{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:40:14Z","timestamp":1740181214726,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_32","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"340-342","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Propositional Proofs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Razborov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Braverman, M., Feldman, V., Klivans, A.R., Pitassi, T.: Learnability and automatizability. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 621\u2013630 (2004)","DOI":"10.1109\/FOCS.2004.36"},{"key":"32_CR2","series-title":"IAS\/Park City mathematics series","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/pcms\/010\/07","volume-title":"Computational Complexity Theory","author":"P. Beame","year":"2004","unstructured":"Beame, P.: Proof complexity. In: Computational Complexity Theory. IAS\/Park City mathematics series, vol.\u00a010, pp. 199\u2013246. American Mathematical Society, Providence (2004)"},{"key":"32_CR3","first-page":"42","volume-title":"Current Trends in Theoretical Computer Science: Entering the 21st Century","author":"P. Beame","year":"2001","unstructured":"Beame, P., Pitassi, T.: Propositional proof complexity: Past, present and future. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: Entering the 21st Century, pp. 42\u201370. World Scientific Publishing, Singapore (2001)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: Bounded arithmetic and propositional proof complexity. In: Logic of Computation, pp. 67\u2013122 (1997)","DOI":"10.1007\/978-3-642-59048-1_3"},{"key":"32_CR5","unstructured":"Buss, S.R.: Towards NP-P via proof complexity and search (2009), http:\/\/math.ucsd.edu\/~sbuss\/ResearchWeb\/lfcsSurvey"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proceedings of the 7th Annual ACM Symposium on the Theory of Computing, pp. 83\u201397 (1975)","DOI":"10.1145\/800116.803756"},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, A.R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"Journal of Symbolic Logic"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Yu Grigoriev, D., Hirsch, E.A., Pasechnik, D.V.: Complexity of semi-algebraic proofs. In: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, pp. 419\u2013430 (2002)","DOI":"10.1007\/3-540-45841-7_34"},{"key":"32_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded arithmetic, propositional logic and complexity theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded arithmetic, propositional logic and complexity theory. Cambridge University Press, Cambridge (1995)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S0049-237X(98)80023-2","volume-title":"Handbook of Proof Theory","author":"P. Pudl\u00e1k","year":"1998","unstructured":"Pudl\u00e1k, P.: The lengths of proofs. In: Buss, S. (ed.) Handbook of Proof Theory, pp. 547\u2013637. Elsevier, Amsterdam (1998)"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-79709-8_4","volume-title":"CSR 2008","author":"P. Pudl\u00e1k","year":"2008","unstructured":"Pudl\u00e1k, P.: Twelve problems in proof complexity. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 13\u201327. Springer, Heidelberg (2008)"},{"key":"32_CR12","first-page":"344","volume-title":"Feasible Mathematics II. Progress in Computer Science and Applied Logic","author":"A. Razborov","year":"1995","unstructured":"Razborov, A.: Bounded Arithmetic and lower bounds in Boolean complexity. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol.\u00a013, pp. 344\u2013386. Birkha\u00fcser, Basel (1995)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-61440-0_116","volume-title":"Automata, Languages and Programming","author":"A. Razborov","year":"1996","unstructured":"Razborov, A.: Lower bounds for propositional proofs and independence results in Bounded Arithmetic. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 48\u201362. Springer, Heidelberg (1996)"},{"key":"32_CR14","unstructured":"Razborov, A.: Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution. Manuscript (2002), http:\/\/www.genesis.mi.ras.ru\/~razborov"},{"key":"32_CR15","unstructured":"Razborov, A.: Propostional proof complexity. Lecture notes of a course taught at the University of Chicago (2009), http:\/\/people.cs.uchicago.edu\/~razborov\/teaching\/winter09\/notes.pdf"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2178\/bsl\/1203350879","volume":"13","author":"N. Segerlind","year":"2007","unstructured":"Segerlind, N.: The complexity of propositional proofs. Bulletin of Symbolic Logic\u00a013(4), 417\u2013481 (2007)","journal-title":"Bulletin of Symbolic Logic"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2178\/bsl\/1203350879","volume":"1","author":"A. Urquhart","year":"1995","unstructured":"Urquhart, A.: The complexity of propositional proofs. Bulletin of Symbolic Logic\u00a01, 425\u2013467 (1995)","journal-title":"Bulletin of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:07:09Z","timestamp":1740179229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_32"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}