{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T10:51:01Z","timestamp":1672743061225},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":[[1998,11]]},"DOI":"10.1016\/s0020-0190(98)00163-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"161-165","source":"Crossref","is-referenced-by-count":3,"title":["Complexity versus stability for classes of propositional formulas"],"prefix":"10.1016","volume":"68","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(98)00163-X_BIB1","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\/S0020-0190(98)00163-X_BIB2","series-title":"Proc. 3rd Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"issue":"3","key":"10.1016\/S0020-0190(98)00163-X_BIB3","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1006\/jcss.1995.1087","article-title":"A dichotomy theorem for maximum generalized satisfiability","volume":"51","author":"Creignou","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0020-0190(98)00163-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.0016","article-title":"Complexity of generalized satisfiability counting problems","volume":"125","author":"Creignou","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00163-X_BIB5","series-title":"Complexity characterizations of Boolean constraint satisfaction problems, Manuscript","author":"Creignou","year":"1997"},{"key":"10.1016\/S0020-0190(98)00163-X_BIB6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.2307\/2268661","article-title":"On sentences which are true of direct unions of algebras","volume":"16","author":"Horn","year":"1951","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/S0020-0190(98)00163-X_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90028-7","article-title":"On the complexity of the maximum satisfiability problem for Horn formulas","volume":"26","author":"Jaumard","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00163-X_BIB8","article-title":"The optimization complexity of constraint satisfaction problems","author":"Khanna","year":"1996","journal-title":"Stanford University Tech. Note STAN-CS-TN-96-29"},{"key":"10.1016\/S0020-0190(98)00163-X_BIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(90)90069-A","article-title":"Existence of simple propositionals formulas","volume":"36","author":"B\u00fcning","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00163-X_BIB10","series-title":"Proc. 10th Annual Symposium on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0020-0190(98)00163-X_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800163X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800163X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:55:16Z","timestamp":1556376916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909800163X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S002001909800163X"],"URL":"http:\/\/dx.doi.org\/10.1016\/s0020-0190(98)00163-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}
