{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:09:48Z","timestamp":1792156188269,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262763","type":"print"},{"value":"9783540316794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_35","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:56:25Z","timestamp":1279144585000},"page":"430-436","source":"Crossref","is-referenced-by-count":12,"title":["Automated Generation of Simplification Rules for SAT and MAXSAT"],"prefix":"10.1007","author":[{"given":"Alexander S.","family":"Kulikov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume-title":"Algorithms and Computations","author":"N. Bansal","year":"1999","unstructured":"Bansal, N., Raman, V.: Upper bounds for MaxSat: Further improved. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 247\u2013258. Springer, Heidelberg (1999)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Byskov, J.M., Madsen, B.A., Skjernaa, B.: New algorithms for exact satisfiability. Technical Report RS-03-30, BRICS (2003)","DOI":"10.7146\/brics.v10i30.21798"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-45995-2_32","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Chen","year":"2002","unstructured":"Chen, J., Kanj, I.: Improved exact algorithms for MAX-SAT. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 341\u2013355. Springer, Heidelberg (2002)"},{"key":"35_CR4","first-page":"129","volume":"293","author":"S.S. Fedin","year":"2002","unstructured":"Fedin, S.S., Kulikov, A.S.: A 2|E|\/4-time algorithm for MAX-CUT. Zapiski nauchnykh seminarov POMI\u00a0293, 129\u2013138 (2002)","journal-title":"Zapiski nauchnykh seminarov POMI"},{"key":"35_CR5","first-page":"111","volume":"316","author":"S.S. Fedin","year":"2004","unstructured":"Fedin, S.S., Kulikov, A.S.: Automated proofs of upper bounds on the running time of splitting algorithms. Zapiski nauchnykh seminarov POMI\u00a0316, 111\u2013128 (2004)","journal-title":"Zapiski nauchnykh seminarov POMI"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"35_CR7","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. Journal of Automated Reasoning\u00a024(4), 397\u2013420 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"35_CR8","unstructured":"Nikolenko, S.I., Sirotkin, A.V.: Worst-case upper bounds for sat: automated proof. In: Proceedings of the 8th ESSLLI Student Session, pp. 225\u2013232 (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:55Z","timestamp":1605643255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11499107_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}