{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:55Z","timestamp":1725677635435},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_20","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T08:25:56Z","timestamp":1335601556000},"page":"212-223","source":"Crossref","is-referenced-by-count":1,"title":["The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter"],"prefix":"10.1007","author":[{"given":"Junping","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The Complexity of Satisfiability Problems. In: 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(01)00257-2","volume":"287","author":"L. Drori","year":"2002","unstructured":"Drori, L., Peleg, D.: Faster Exact Solutions for Some NP-hard Problems. Theoretical Computer Science\u00a0287(2), 473\u2013499 (2002)","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","first-page":"231","volume-title":"Fifth International Symposium on the Theory and Applications of Satisfiability Testing","author":"S. Porschen","year":"2002","unstructured":"Porschen, S., Randerath, B., Speckenmeyer, E.: X3SAT is Decidable in time O(2\n                  n\/5). In: Fifth International Symposium on the Theory and Applications of Satisfiability Testing, pp. 231\u2013235. Springer, Heidelberg (2002)"},{"key":"#cr-split#-20_CR4.1","unstructured":"Porschen, S., Randerath, B., Speckenmeyer, E.: Exact 3-Satisfiability is Decidable in time O(20.16254n  ) (June 2002) (manuscript)"},{"key":"#cr-split#-20_CR4.2","doi-asserted-by":"crossref","unstructured":"Annals of Mathematics and Artificial Intelligence 43(1) 173-193 (2005)","DOI":"10.1007\/s10472-004-9428-x"},{"key":"20_CR5","first-page":"118","volume":"293","author":"A.S. Kulikov","year":"2002","unstructured":"Kulikov, A.S.: An Upper Bound O(20.16254n\n                ) for Exact 3-Satisfiability: a Simpler Proof. Zapiski Nauchnyh Seminarov POMI\u00a0293, 118\u2013128 (2002)","journal-title":"Zapiski Nauchnyh Seminarov POMI"},{"issue":"2-3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2004.02.035","volume":"320","author":"V. Dahllof","year":"2004","unstructured":"Dahllof, V., Jonsson, P., Beigel, R.: Algorithms for Four Variants of the Exact Satisfiability Problem. Theoretical Computer Science\u00a0320(2-3), 373\u2013394 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.tcs.2004.12.023","volume":"332","author":"J.M. Byskov","year":"2005","unstructured":"Byskov, J.M., Madsen, B.A., Skjernaa, B.: New Algorithms for Exact Satisfiability. Theoretical Computer Science\u00a0332(1-3), 515\u2013541 (2005)","journal-title":"Theoretical Computer Science"},{"key":"20_CR8","unstructured":"Skjernaa, B.: Exact Algorithms for Variants of Satisfiability and Colouring Problems. PhD thesis, Department of Computer Science, Aarhus University (2004)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ipl.2005.08.011","volume":"97","author":"A.M. Bolette","year":"2006","unstructured":"Bolette, A.M.: An Algorithm for Exact Satisfiability Analysed with the Number of Clauses as Parameter. Information Processing Letters\u00a097(1), 28\u201330 (2006)","journal-title":"Information Processing Letters"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1023\/A:1006340920104","volume":"24","author":"E.A. Hirsch","year":"2000","unstructured":"Hirsch, E.A.: New Worst-Case Upper Bounds for SAT. J. Auto. Reasoning\u00a024(4), 397\u2013420 (2000)","journal-title":"J. Auto. Reasoning"},{"key":"20_CR11","first-page":"419","volume":"43","author":"B. Monien","year":"1981","unstructured":"Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods Oper. Res.\u00a043, 419\u2013431 (1981)","journal-title":"Methods Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:14:02Z","timestamp":1620112442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}