Propositional proof complexity
Journal of the ACM (JACM)
On Reducibility and Symmetry of Disjoint NP-Pairs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Automatizability of Resolution and Related Propositional Proof Systems
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
Optimality of size-width tradeoffs for resolution
Computational Complexity
On the automatizability of resolution and related propositional proof systems
Information and Computation
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
Classes of representable disjoint NP-pairs
Theoretical Computer Science
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
Boundary Points and Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
Clause learning can effectively P-simulate general propositional resolution
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Artificial Intelligence
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
From feasible proofs to feasible computations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Mean-payoff games and propositional proofs
Information and Computation
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proof complexity of propositional default logic
Archive for Mathematical Logic
Disjoint NP-pairs from propositional proof systems
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Conjunctive query evaluation by search tree revisited
ICDT'05 Proceedings of the 10th international conference on Database Theory
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proof complexity of propositional default logic
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this paper, we show that this method cannot be used to obtain lower bounds for Frege systems, or even for TC0-Frege systems. More specifically, we show that unless factoring (of Blum integers) is feasible, neither Frege nor TC0-Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial-sized TC0-Frege.As a corollary, we obtain that TC0-Frege, as well as any proof system that polynomially simulates it, is not automatizable (under the assumption that factoring of Blum integers is hard). We also show under the same hardness assumption that the k-provability problem for Frege systems is hard.