{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:25:29Z","timestamp":1648898729176},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996,1]]},"DOI":"10.1016\/0020-0190(95)00180-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:22:55Z","timestamp":1027624975000},"page":"89-93","source":"Crossref","is-referenced-by-count":1,"title":["On 2-QBF truth testing in parallel"],"prefix":"10.1016","volume":"57","author":[{"given":"Bengt","family":"Aspvall","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Storlind","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00180-8_BIB1_1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00180-8_BIB1_2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(82)90036-9","article-title":"Erratum","volume":"14","author":"Aspvall","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00180-8_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(92)90199-6","article-title":"A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula","volume":"43","author":"Chen","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00180-8_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(88)90069-5","article-title":"A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula","volume":"27","author":"Cook","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00180-8_BIB4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(93)90038-B","article-title":"An efficiently solvable graph partition problem to which many problems are reducible","volume":"45","author":"Gavril","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00180-8_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(85)90068-X","article-title":"Uniquely solvable quadratic Boolean equations","volume":"12","author":"Hansen","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(95)00180-8_BIB6","first-page":"67","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/0020-0190(95)00180-8_BIB7","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001808?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001808?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:18Z","timestamp":1555959138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0020019095001808"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00180-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}