Exponential separation between Res(k) and Res(k + 1) for k ≤ &949; logn
Information Processing Letters
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
An Exponential Lower Bound for Width-Restricted Clause Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exponential separation between Res (k) and Res(k+1) for k≤εlogn
Information Processing Letters
Improved lower bounds for tree-like resolution over linear inequalities
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Complexity of semialgebraic proofs with restricted degree of falsity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
An improved separation of regular resolution from pool resolution and clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to formulas in disjunctive normal form (DNFs) with small terms. We use this to prove lower bounds for the Res(k) propositional proof system, an extension of resolution which works with k-DNFs instead of clauses. We also obtain an exponential separation between depth d circuits of bottom fan-in k and depth d circuits of bottom fan-in k + 1.Our results for Res(k) are as follows: The 2n to n weak pigeonhole principle requires exponential size to refute in Res(k) for $k \leq \sqrt{\log n / \log \log n } $. For each constant k, there exists a constant w k so that random w-CNFs require exponential size to refute in Res(k). For each constant k, there are sets of clauses which have polynomial size Res(k + 1) refutations but which require exponential size Res(k) refutations.