{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:30Z","timestamp":1781077650554,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540634379","type":"print"},{"value":"9783540695479","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029954","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:59Z","timestamp":1133400299000},"page":"110-116","source":"Crossref","is-referenced-by-count":3,"title":["Resolution proofs, exponential bounds, and Kolmogorov complexity"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"P. Beame, T. Pitassi. Simplified and improved resolution lower bounds. Proc. 37th IEEE Sympos. Foundations of Computer Science 1996.","DOI":"10.1109\/SFCS.1996.548486"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(90)90141-J","volume":"34","author":"S. Cook","year":"1990","unstructured":"S. Cook, T. Pitassi. A feasible constructive lower bound proof for resolution proofs. Information Processing Letters\n34 (1990) 81\u201385.","journal-title":"Information Processing Letters"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"F.R.K. Chung. Constructing random-like graphs. In: B. Bollobs (ed.): Probabilistic Combinatorics and Applications, Proceedings of Symposia in Applied Mathematics, Vol. 44, pp. 21\u201355. American Math. Society, 1991.","DOI":"10.1090\/psapm\/044\/1141922"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","volume":"35","author":"V. Chv\u00e1tal","year":"1988","unstructured":"V. Chv\u00e1tal, E. Szemer\u00e9di. Many hard examples for resolution. Journal of the Assoc. for Comput. Mach.\n35 (1988) 759\u2013768.","journal-title":"Journal of the Assoc. for Comput. Mach."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"A. Haken. The intractability of resolution. Theoretical Computer Science\n39 (1985) 297\u2013308.","journal-title":"Theoretical Computer Science"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"M. Li, P. Vitanyi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"11_CR7","unstructured":"M. Paterson. Improved sorting networks with O(log n) depth. Algorithmica, to appear."},{"key":"11_CR8","unstructured":"M. Pinsker. On the complexity of a concentrator. 7th Int. Teletraffic Conference. 1973, 318\/1-318\/4."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N. Pippenger","year":"1977","unstructured":"N. Pippenger. Superconcentrators. SIAM J. Comput.\n6 (1977) 298\u2013304.","journal-title":"SIAM J. Comput."},{"key":"11_CR10","unstructured":"U. Sch\u00f6ning. Better expanders and superconcentrators by Kolmogorov complexity. 4th International Colloq. on Structural Information and Communication Complexity, 1997."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. Sipser, D.A. Spielman. Expander codes. Proc. 35th IEEE Sympos. Foundations of Computer Science, 566\u2013576, 1994.","DOI":"10.1109\/SFCS.1994.365734"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"G.S. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968. Reprinted in Siekmann, Wrightson: Automization of Reasoning, Springer-Verlag, 1983.","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"A. Urquhart. Hard examples for resolution. Journal of the Assoc. Comput. Mach.\n34 (1987) 209\u2013219.","journal-title":"Journal of the Assoc. Comput. Mach."},{"key":"11_CR14","unstructured":"D. Welsh. Codes and Cryptography. Oxford University Press, 1988."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T01:53:05Z","timestamp":1549417985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029954","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}