{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:55:15Z","timestamp":1715061315670},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0890-5401(03)00092-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"1-19","source":"Crossref","is-referenced-by-count":13,"title":["Optimal satisfiability for propositional calculi and constraint satisfaction problems"],"prefix":"10.1016","volume":"186","author":[{"given":"Steffen","family":"Reith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00092-0_BIB1","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":"Information and Computation"},{"issue":"6","key":"10.1016\/S0890-5401(03)00092-0_BIB2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","article-title":"On generating all solutions of generalized satisfiability problems","volume":"31","author":"Creignou","year":"1997","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB3","doi-asserted-by":"crossref","unstructured":"N. Creignou, S. Khanna, M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, Monographs on Discrete Applied Mathematics, SIAM, 2000","DOI":"10.1137\/1.9780898718546"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1006\/jcss.1995.1087","article-title":"A dichotomy theorem for maximum generalized satisfiability problems","volume":"51","author":"Creignou","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB5","series-title":"Boolesche Funktionen und Postsche Klassen","author":"Jablonski","year":"1970"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB6","doi-asserted-by":"crossref","unstructured":"L. Kirousis, P.G. Kolaitis, The complexity of minimal satisfiability problems, in: Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 2010, pp. 407\u2013418, Springer, 2001, Information and Computation, (to appear)","DOI":"10.1007\/3-540-44693-1_36"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB7","unstructured":"J. K\u00f6bler, Strukturelle Komplexit\u00e4t von Anzahlproblemen, PhD thesis, Universit\u00e4t Stuttgart, Fakult\u00e4t f\u00fcr Informatik, 1989"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization functions","volume":"36","author":"Krentel","year":"1988","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(92)90073-O","article-title":"Generalizations of OptP to the polynomial hierarchy","volume":"97","author":"Krentel","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB10","series-title":"Proceedings of the 12th Computational Complexity Conference","first-page":"282","article-title":"Constraint satisfaction: the approximability of minimization problems","author":"Khanna","year":"1997"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB11","series-title":"Proceedings of the 29th Symposium on Theory of Computing","first-page":"11","article-title":"A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction","author":"Khanna","year":"1997"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial-time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01744287","article-title":"Satisfiability problems for propositional calculi","volume":"13","author":"Lewis","year":"1979","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB14","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB15","unstructured":"E.L. Post, Two-value Iterative Systems, 1941"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB16","unstructured":"Steffen Reith, K.W. Wagner, The complexity of problems defined by boolean circuits, Technical Report 255, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, 2000, in: Proceedings of the International Conference Mathematical Foundation of Informatics, Hanoi, October 25\u201328, 1999, to appear"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB17","series-title":"Proccedings of the 10th Symposium on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB18","series-title":"Proceedings 11th Symposium on Theoretical Aspects of Computer Science","first-page":"449","article-title":"On different reducibility notions for function classes","volume":"vol. 775","author":"Vollmer","year":"1994"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB19","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1006\/inco.1995.1109","article-title":"Complexity classes of optimization functions","volume":"120","author":"Vollmer","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(03)00092-0_BIB20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"51","author":"Wagner","year":"1987","journal-title":"Theoretical Computer Science"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000920?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000920?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:19:40Z","timestamp":1584652780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0890540103000920"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00092-0","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}