{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T07:51:21Z","timestamp":1717141881267},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"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":2330,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1016\/j.dam.2006.07.009","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T07:20:12Z","timestamp":1169018412000},"page":"649-653","source":"Crossref","is-referenced-by-count":11,"title":["Computational complexity of some restricted instances of 3-SAT"],"prefix":"10.1016","volume":"155","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]},{"given":"Alexander D.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2006.07.009_bib1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1038\/22001","article-title":"Solving problems in finite time","volume":"400","author":"Anderson","year":"1999","journal-title":"Nature"},{"key":"10.1016\/j.dam.2006.07.009_bib2","unstructured":"P. Berman, M. Karpinski, A.D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, ECCC TR03-022, 2003, submitted for publication."},{"key":"10.1016\/j.dam.2006.07.009_bib3","unstructured":"P. Berman, M. Karpinski, A.D. Scott, Approximation hardness of short symmetric instances of MAX-3SAT, ECCC TR03-049, 2003."},{"key":"10.1016\/j.dam.2006.07.009_bib4","doi-asserted-by":"crossref","unstructured":"S.C. Cook, The complexity of theorem-proving procedures, in: Proceedings of the Third ACM STOC, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/j.dam.2006.07.009_bib5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(90)90020-D","article-title":"On the r,s-SAT satisfiability problem and a conjecture of Tovey","volume":"26","author":"Dubois","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2006.07.009_bib6","unstructured":"K. Iwama, K. Takaki, Satisfiability of 3CNF formulas with small clause\/variable ratio, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, vol. 35, 1997, pp. 315\u2013333."},{"key":"10.1016\/j.dam.2006.07.009_bib7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0222015","article-title":"One more occurrence of variable makes satisfiability jump from trivial to NP-complete","volume":"8","author":"Kratochv\u00edl","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2006.07.009_bib8","doi-asserted-by":"crossref","first-page":"9209","DOI":"10.1088\/0305-4470\/31\/46\/011","article-title":"Tricritical points in random combinatorics: the 2+p SAT case","volume":"31","author":"Monasson","year":"1998","journal-title":"J. Phys. A"},{"key":"10.1016\/j.dam.2006.07.009_bib9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity from characteristic \u2018phase transitions\u2019","volume":"400","author":"Monasson","year":"1999","journal-title":"Nature"},{"key":"10.1016\/j.dam.2006.07.009_bib10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","article-title":"A simplified satisfiability problem","volume":"8","author":"Tovey","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2006.07.009_bib11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(03)00194-X","article-title":"(2+f(n))-SAT and its properties","volume":"136","author":"Zhao","year":"2004","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X06004677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X06004677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T18:29:32Z","timestamp":1547058572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X06004677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["S0166218X06004677"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2006.07.009","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}