JOURNAL ARTICLE
Non-Automatizability of Bounded-Depth Frege Proofs
Marı́a Luisa BonetCarlos DomingoRicard Gavald�Alexis MacielToniann Pitassi
Year: 2004 Journal: Computational Complexity Vol: 13 (1-2)Pages: 47-68 Publisher: Birkhäuser
Keywords:
Bounded function Corollary Mathematical proof Mathematics Argument (complex analysis) Discrete mathematics Polynomial
Metrics
69
Cited By
2.32
FWCI (Field Weighted Citation Impact)
20
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Cryptography and Data Security
Physical Sciences → Computer Science → Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Cryptography and Residue Arithmetic
Physical Sciences → Computer Science → Information Systems
Related Documents
JOURNAL ARTICLE
Non-automatizability of bounded-depth Frege proofs
Marı́a Luisa BonetCarlos DomingoRicard GavaldàAlexis MacielToniann Pitassi
Year: 2003 Vol: 39 Pages: 15-23
JOURNAL ARTICLE
Theories for Subexponential-size Bounded-depth Frege Proofs
Journal: Leibniz-Zentrum für Informatik (Schloss Dagstuhl) Year: 2013
JOURNAL ARTICLE
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
Journal: ACM Transactions on Computational Logic Year: 2010 Vol: 11 (3)Pages: 1-17
BOOK-CHAPTER
Towards lower bounds for bounded-depth Frege proofs with modular connectives
DIMACS series in discrete mathematics and theoretical computer science Year: 1997 Pages: 195-227
JOURNAL ARTICLE
Tradeoffs for small-depth Frege proofs
Toniann PitassiPrasanna RamakrishnanLi-Yang Tan
Year: 2022 Vol: 145 Pages: 445-456