{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:09:57Z","timestamp":1648937397033},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0022-0000(03)00079-5","type":"journal-article","created":{"date-parts":[[2003,11,20]],"date-time":"2003-11-20T13:03:07Z","timestamp":1069333387000},"page":"772-788","source":"Crossref","is-referenced-by-count":2,"title":["Improving a fixed parameter tractability time bound for the shadow problem"],"prefix":"10.1016","volume":"67","author":[{"given":"Peter","family":"Heusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Porschen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewald","family":"Speckenmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00079-5_BIB1","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third ACM Symposium on Theory of Computing, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB2","first-page":"161","article-title":"Fixed parameter tractability and completeness","volume":"87","author":"Downey","year":"1992","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0166-218X(99)00038-4","article-title":"An algorithm for the class of pure implicational formulas","volume":"96","author":"Franco","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0022-0000(03)00079-5_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB5","series-title":"Satisfiability Problem: Theory and Applications, DIMACS Workshop, March 11\u201313, 1996","first-page":"19","article-title":"Algorithms for the satisfiability (SAT) problem: a survey","volume":"Vol. 35","author":"Gu","year":"1997"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB6","unstructured":"P. Heusch, Implikationen der Implikation, Ph.D. Thesis, Mathematisches Institut, Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, 1993."},{"key":"10.1016\/S0022-0000(03)00079-5_BIB7","doi-asserted-by":"crossref","unstructured":"P. Heusch, The complexity of the falsifiability problem for pure implicational formulas, in: J. Wiedermann, P. Hajek (Eds.), Proceedings of the Twentieth International Symposium on Mathematical Foundations of Computer Science (MFCS\u201995), Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 221\u2013226.","DOI":"10.1007\/3-540-60246-1_128"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB8","series-title":"Aussagenlogik: Deduktion und Algorithmen","author":"Kleine B\u00fcning","year":"1994"},{"key":"10.1016\/S0022-0000(03)00079-5_BIB9","first-page":"25","article-title":"The shortest axiom of the implicational calculus of propositions","volume":"A52","author":"Lukasiewicz","year":"1948","journal-title":"Proc. Irish Acad."},{"key":"10.1016\/S0022-0000(03)00079-5_BIB10","first-page":"30","article-title":"Untersuchungen \u00fcber den Aussagenkalk\u00fcl","volume":"23","author":"Lukasiewicz","year":"1930","journal-title":"C. R. Soc. Sci. Lett. Varsovie Cl III"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000795?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000795?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:52:10Z","timestamp":1550361130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0022000003000795"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00079-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}