1. M. Ajtai . 1990. Parity and the Pigeonhole Principle . Birkhäuser Boston , Boston, MA , 1–24. M. Ajtai. 1990. Parity and the Pigeonhole Principle. Birkhäuser Boston, Boston, MA, 1–24.
2. Albert Atserias and Massimo Lauria . 2019 . Circular (Yet Sound) Proofs. In Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference , SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings(Lecture Notes in Computer Science, Vol. 11628) , Mikolás Janota and Inês Lynce (Eds.). Springer, 1–18. Albert Atserias and Massimo Lauria. 2019. Circular (Yet Sound) Proofs. In Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings(Lecture Notes in Computer Science, Vol. 11628), Mikolás Janota and Inês Lynce (Eds.). Springer, 1–18.
3. Proof Complexity Meets Algebra
4. The Relative Complexity of NP Search Problems
5. P. Beame , R. Impagliazzo , J. Krajicek , T. Pitassi , and P. Pudlak . 1994. Lower bounds on Hilbert’s Nullstellensatz and propositional proofs . In Proceedings 35th Annual Symposium on Foundations of Computer Science. 794–806 . P. Beame, R. Impagliazzo, J. Krajicek, T. Pitassi, and P. Pudlak. 1994. Lower bounds on Hilbert’s Nullstellensatz and propositional proofs. In Proceedings 35th Annual Symposium on Foundations of Computer Science. 794–806.