{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:06:21Z","timestamp":1778594781468,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,3]]},"DOI":"10.1016\/0020-0190(79)90002-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"121-123","source":"Crossref","is-referenced-by-count":611,"title":["A linear-time algorithm for testing the truth of certain quantified boolean formulas"],"prefix":"10.1016","volume":"8","author":[{"given":"Bengt","family":"Aspvall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael F.","family":"Plass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert Endre","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90002-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(79)90002-4_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Ann. ACM Symp. Theory Comput."},{"issue":"4","key":"10.1016\/0020-0190(79)90002-4_BIB3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multi-commodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90002-4_BIB4","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0190(79)90002-4_BIB5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/800133.804350","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978","journal-title":"Proc. 10th Ann. ACM Symp. Theory Comput."},{"key":"10.1016\/0020-0190(79)90002-4_BIB6","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973","journal-title":"Proc. 5th Ann. ACM Symp. Theory Comput."},{"issue":"2","key":"10.1016\/0020-0190(79)90002-4_BIB7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:45Z","timestamp":1555072125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,3]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,3]]}},"alternative-id":["0020019079900024"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,3]]}}}