{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:43Z","timestamp":1725795883016},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_50","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"600-611","source":"Crossref","is-referenced-by-count":8,"title":["Breaking the PPSZ Barrier for Unique 3-SAT"],"prefix":"10.1007","author":[{"given":"Timon","family":"Hertli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"50_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-7152(94)00090-U","volume":"23","author":"K. Hamza","year":"1995","unstructured":"Hamza, K.: The smallest uniform upper bound on the distance between the mean and the median of the binomial and poisson distributions. Statistics & Probability Letters\u00a023(1), 21\u201325 (1995)","journal-title":"Statistics & Probability Letters"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Hertli, T.: 3-SAT faster and simpler\u2014unique-SAT bounds for PPSZ hold in general. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 277\u2013284. IEEE Computer Soc., Los Alamitos (2011)","DOI":"10.1109\/FOCS.2011.22"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity. J. Comput. System Sci.\u00a063(4), 512\u2013530 (2001); Special issue on FOCS 1998 (Palo Alto, CA)","DOI":"10.1006\/jcss.2001.1774"},{"key":"50_CR4","unstructured":"Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 328\u2013329 (electronic). ACM Press, New York (2004)"},{"key":"50_CR5","volume-title":"The Theory of Error-Correcting Codes","author":"F.F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.F.J., Sloane, N.N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Paturi, R., Pudl\u00e1k, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. J. ACM\u00a052(3), 337\u2013364 (electronic) (2005)","DOI":"10.1145\/1066100.1066101"},{"key":"50_CR7","first-page":"410","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"U. Sch\u00f6ning","year":"1999","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 410\u2013414. IEEE Computer Society, Los Alamitos (1999)"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11561071_12","volume-title":"Algorithms \u2013 ESA 2005","author":"M. Wahlstr\u00f6m","year":"2005","unstructured":"Wahlstr\u00f6m, M.: An algorithm for the SAT problem for formulae of linear length. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 107\u2013118. Springer, Heidelberg (2005)"},{"key":"50_CR9","unstructured":"Welzl, E.: Boolean Satisfiability \u2013 Combinatorics and Algorithms (Lecture Notes) (2005), \n                    \n                      www.inf.ethz.ch\/~emo\/SmallPieces\/SAT.ps"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:20:45Z","timestamp":1558909245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}