Alexander Razborov
Skip Abstract Section
Abstract
This essay is a highly personal and biased account of some main concepts and several research directions in modern propositional proof complexity. Special attention will be paid to connections with other disciplines.
- M. Alekhnovich. Lower bounds for k-DNF resolution on random 3-CNFs. Computational Complexity, 20(4):597--614, 2011. Google Scholar
Digital Library
- M. Alekhnovich, S. Arora, and I. Tourlakis. Toward strong nonapproximability results in the Lovász-Schrijver hierarchy. Computational Complexity, 20(4):615--648, 2011. Google ScholarDigital Library
- M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Space complexity in propositional calculus. SIAM Journal on Computing, 31(4):1184--1211, 2002. Google ScholarDigital Library
- M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Pseudorandom generators in propositional proof complexity. SIAM Journal on Computing, 34(1):67--88, 2004. Google ScholarDigital Library
- M. Alekhnovich and A. Razborov. Lower bounds for the polynomial calculus: non-binomial case. Proceedings of the Steklov Institute of Mathematics, 242:18--35, 2003.Google Scholar
- M. Alekhnovich and A. Razborov. Resolution is not automatizable unless W{P} is tractable. SIAM Journal on Computing, 38(4):1347--1363, 2008. Google ScholarDigital Library
- S. Arora and B. Barak. Computational Complexity: a Modern Approach. Cambridge University Press, 2009. Google ScholarDigital Library
- B. Barak, S. Hopkins, J. Kelner, P. Kothari, A. Moitra, and A. Potechin. A nearly tight sum-of-squares lower bound for the planted clique problem. Technical Report TR16-058, Electronic Colloquium on Computational Complexity, 2016.Google ScholarCross Ref
- B. Barak and D. Steurer. Sum-of-squares proofs and the quest toward optimal algorithms. In Proceedings of International Congress of Mathematicians (ICM), volume IV, pages 509--533, 2014.Google Scholar
- P. Beame, T. Huynh, and T. Pitassi. Hardness amplification in proof complexity. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing,, pages 87--96, 2010. Google ScholarDigital Library
- P. Beame and S. Riis. More on the relative strength of counting principles. In P. Beame and S. Buss, editors, Proof Complexity and Feasible Arithmetics: DIMACS workshop, April 21-24, 1996, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 39, pages 13--35. American Math. Soc., 1997.Google Scholar
- E. Ben-Sasson. Expansion in Proof Complexity. PhD thesis, Hebrew University, 2001.Google Scholar
- E. Ben-Sasson. Hard examples for bounded depth Frege. In Proceedings of the 34th ACM Symposium on the Theory of Computing, pages 563--572, 2002. Google ScholarDigital Library
- E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Journal of the ACM, 48(2):149--169, 2001. Google ScholarDigital Library
- O. Beyersdorff, N. Galesi, M. Lauria, and A. Razborov. Parameterized bounded-depth Frege is not optimal. ACM Transactions on Computation Theory, 7:article 7, 2012. Google ScholarDigital Library
- I. Bonacina, N. Galesi, and N. Thapen. Total space in resolution. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science, pages 641--650, 2014. Google ScholarDigital Library
- J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen, and T. Pitassi. Rank bounds and integrality gaps for cutting planes procedures. Theory of Computing, 2:65--90, 2006.Google ScholarCross Ref
- S. Buss, D. Grigoriev, R. Impagliazzo, and T. Pitassi. Linear gaps between degrees for the Polynomial Calculus modulo distinct primes. Journal of Computer and System Sciences, 62:267--289, 2001. Google ScholarDigital Library
- S. R. Buss. Bounded Arithmetic. Bibliopolis, Napoli, 1986.Google Scholar
- M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Groebner basis algorithm to find proofs of unsatisfiability. In Proceedings of the 28th ACM STOC, pages 174--183, 1996. Google ScholarDigital Library
- S. Cook and P. Nguyen. Logical Foundations of Proof Complexity. Cambridge University Press, 2014. Google ScholarDigital Library
- S. A. Cook and A. R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44(1):36--50, 1979.Google ScholarCross Ref
- J. Ding, A. Sly, and N. Sun. Proof of the satis ability conjecture for large k. Technical Report 1411.0650{math.PR}, arXiv e-print, 2014.Google Scholar
- J. L. Esteban and J. Torán. Space bounds for resolution. Information and Computation, 171(1):84--97, 2001. Google ScholarDigital Library
- U. Feige. Relations between average case complexity and approximation complexity. In Proceedings of the 34th ACM Symposium on the Theory of Computing, pages 534--543, 2002. Google ScholarDigital Library
- N. Galesi and M. Lauria. On the automatizability of polynomial calculus. Theory of Computing Systems, 47(2):491--506, 2010. Google ScholarDigital Library
- D. Grigoriev. Linear lower bounds on degrees of Postivestellensatz calculus proofs for the parity. Theoretical Computer Science, 259:613--622, 2001.Google ScholarCross Ref
- D. Yu. Grigoriev, E. A. Hirsch, and D. V. Pasechnik. Complexity of semi-algebraic proofs. Moscow Mathematical Journal, 2(4):647--679, 2002.Google ScholarCross Ref
- J. Grochow and T. Pitassi. Circuit complexity, proof complexity, and polynomial identity testing. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science, pages 110--119, 2014. Google ScholarDigital Library
- S. Jukna. Boolean Function Complexity: Advances and frontiers. Springer-Verlag, 2012. Google ScholarDigital Library
- M. Kauers, R. O'Donnell, Li-Yang Tan, and Y. Zhou. Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. Technical Report arXiv:1212.5324v3 {cs.CC}, arXiv e-print, 2012. To appear in Discrete Analysis.Google Scholar
- J. Krajíček. Bounded arithmetic, propositional logic and complexity theory. Cambridge University Press, 1995. Google ScholarDigital Library
- J. Krajíček. Tautologies from pseudo-random generators. Bulletin of Symbolic Logic, 7(2):197--212, 2001.Google ScholarCross Ref
- J. Krajíček. Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds. Journal of Symbolic Logic, 69(1):265--286, 2004.Google ScholarCross Ref
- J. Krajíček. Forcing with Random Variables and Proof Complexity, LMS Lecture Notes Series 382. Cambridge University Press, 2011.Google Scholar
- J. Krajíček and P. Pudlák. Propositional proof systems, the consistency of first order theories and the complexity of computations. Journal of Symbolic Logic, 54(3):1063--1079, 1989.Google ScholarCross Ref
- J. Krajíček and P. Pudlák. Some consequences of cryptographical conjectures for S1/2 and EF. Information and Computation, 142:82--94, 1998. ACM Google ScholarDigital Library
- J. Krajíček, P. Pudlák, and A. R. Woods. Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms, 7(1):15--39, 1995. Google ScholarDigital Library
- J. R. Lee, P. Raghavendra, and D. Steurer. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 567--576, 2015. Google ScholarDigital Library
- S. Buss M. Bonet and T. Pitassi. Are there hard examples for Frege systems. In Feasible Mathematics, Volume II, pages 30--56. Birkhauser, 1994.Google Scholar
- J. Nordström. Pebble games, proof complexity and time-space trade-offs. Logical Methods in Computer Science, 9:1--63, 2013.Google ScholarCross Ref
- J. Nordström. On the interplay between proof complexity and SAT solving. ACM SIGLOG News, 2(3):19--44, 2015. Google ScholarDigital Library
- T. Pitassi, P. Beame, and R. Impagliazzo. Exponential lower bounds for the pigeonhole principle. Computational Complexity, 3:97--140, 1993. Google ScholarDigital Library
- T. Pitassi, B. Rossman, R. A. Servedio, and Li-Yang Tan. Poly-logarithmic Frege depth lower bounds via an expander switching lemma. To appear in STOC 2016, 2016. Google ScholarDigital Library
- P. Pudlák. Lower bounds for resolution and cutting planes proofs and monotone computations. Journal of Symbolic Logic, 62(3):981--998, 1997.Google ScholarCross Ref
- P. Pudlák. On the complexity of propositional calculus. In Sets and Proofs, Invited papers from Logic Colloquium'97, pages 197--218. Cambridge University Press, 1999.Google Scholar
- P. Raghavendra and D. Steurer. Graph expansion and the Unique Games Conjecture. In Proceedings of the 42nd ACM Symposium on the Theory of Computing, pages 755--764, 2010. Google ScholarDigital Library
- A. Razborov. Bounded Arithmetic and lower bounds in Boolean complexity. In P. Clote and J. Remmel, editors, Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol. 13, pages 344--386. Birkhaüser, 1995.Google Scholar
- A. Razborov. Lower bounds for the polynomial calculus. Computational Complexity, 7:291--324, 1998. Google ScholarDigital Library
- A. Razborov. Proof complexity of pigeonhole principles. In Proceedings of the 5th DLT, Lecture Notes in Computer Science, 2295, pages 100--116, New York/Berlin, 2002. Springer-Verlag. Google ScholarDigital Library
- A. Razborov. Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution. Annals of Mathematics, 181(3):415--472, 2015.Google ScholarCross Ref
- A. Razborov. On the width of semi-algebraic proofs and algorithms. Technical Report TR16- 010, Electronic Colloquium on Computational Complexity, 2016.Google Scholar
- A. Razborov and S. Rudich. Natural proofs. Journal of Computer and System Sciences, 55(1):24--35, 1997. Google ScholarDigital Library
- R. A. Reckhow. On the lengths of proofs in the propositional calculus. Technical Report 87, University of Toronto, 1976.Google Scholar
- G. Schoenebeck. Linear level Lasserre lower bounds for certain k-CSPs. In Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pages 593--602, 2008. Google ScholarDigital Library
- M. Tulsiani. CSP gaps and reductions in the Lasserre hierarchy. In Proceedings of the 41st ACM Symposium on the Theory of Computing, pages 303--312, 2009. Google ScholarDigital Library
- M. Tulsiani. Lovász-Schrijver reformulation. In Wiley Encyclopedia of Operations Research & Management Science. 2011.Google Scholar
Index Terms
- Guest Column: Proof Complexity and Beyond
Index terms have been assigned to the content through auto-classification.
Recommendations
Verification Column
Automated theorem proving can be seen as a logic-based approach for generating mathematical proofs mechanically. Important applications are hardware and software verification, general-purpose proof assistants and proof checking. Most state-of-the-art ...
Automata column
A central problem of logic in computer science is finding logics for which the satisfiability problem is decidable. A famous non-example is first-order logic, for which satisfiability is undecidable. One method to avoid such undecidability is to find ...
Semantics column
In this quarter's column, Andrzej Murawski and Nikos Tzevelekos offer us an invitation to game semantics. This approach to giving semantics originated in work of the philosopher and mathematician Paul Lorenzen in the late 1950s [10], who viewed the ...
Comments