{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:42Z","timestamp":1725664962986},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617327"},{"type":"electronic","value":"9783540707400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61732-9_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:16:44Z","timestamp":1330276604000},"page":"197-212","source":"Crossref","is-referenced-by-count":8,"title":["A new approach on solving 3-satisfiability"],"prefix":"10.1007","author":[{"given":"Robert","family":"Rodo\u0161ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","unstructured":"Beigel, R., Eppstein, D.: 3-Coloring in Time O(1.3446n): A No-MIS Algorithm. In Technical Report ECCC TR95-33 (1995)"},{"key":"13_CR2","volume-title":"Discrete Mathematics","author":"N. L. Biggs","year":"1994","unstructured":"Biggs, N. L.: Discrete Mathematics. Oxford Science Publications, New York (1994)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery 7(3) (1960) 201\u2013215","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","volume":"1","author":"R. E. Fikes","year":"1970","unstructured":"Fikes, R. E.: REF-ARF: A System for Solving Problems Stated as Procedures. Artificial Intelligence 1 (1970) 27\u2013120","journal-title":"Artificial Intelligence"},{"key":"13_CR5","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability. W. H. Freeman and Company, San Francisco (1979)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The Intractability of Resolution. Theoretical Computer Science 39 (1985) 297\u2013308","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","unstructured":"Jeavons, P. G.: The Expressive Power of Constraint Networks. In Technical Report CSD-TR-640, Royal Holloway and Bedford New College, University of London (1990)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: A Note on the Complexity of the Chromatic Number Problem. Inf. Proc. Lett. 5 (1976) 66\u201367","journal-title":"Inf. Proc. Lett."},{"key":"13_CR9","volume-title":"Technical Report","author":"J. Mayer","year":"1994","unstructured":"Mayer, J., Mitterreiter, I., Radermacher, F. J.: Running Time Experiments on some Algorithms for Solving Propositional Satisfiability Problems. In Technical Report, Forschungsinstitut f\u00fcr anwendungsorientierte Wissensverarbeitung, Ulm (1994)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","volume":"10","author":"B. Monien","year":"1985","unstructured":"Monien, B., Speckenmeyer, E.: Solving Satisfiability in less than 2n Steps. Discrete Appl. Math. 10 (1985) 287\u2013295","journal-title":"Discrete Appl. Math."},{"key":"13_CR11","unstructured":"Rodo\u0161ek, R.: Combining Heuristics for Constraint Satisfaction Problems. Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis (1995) 147\u2013156"},{"key":"13_CR12","unstructured":"Schiermeyer, I.: Solving 3-Satisfiability in less than 1.579n Steps. 6th Workshop Computer Science Logic, Spring-Verlag (1993) 379\u2013394"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I.: Deciding 3-Colourability in less than O(1.415n) Steps. 19th Int. Workshop Graph-Theoretic Concepts in Computer Science, Spring-Verlag (1994) 177\u2013182","DOI":"10.1007\/3-540-57899-4_51"},{"key":"13_CR14","unstructured":"Tr\u00fcmper, K., Radermacher, F. J.: Analyse der Leistungsf\u00e4higkeit eines neuen Systems zur Auswertung aussagenlogischer Probleme. In Technical Report FAW-TR-90003 (1990)"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard Examples for Resolution. JACM 34 (1987) 209\u2013219","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Mathematical Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61732-9_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:04Z","timestamp":1619559364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61732-9_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617327","9783540707400"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61732-9_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}