Abstract
A general framework for parameterized proof complexity was introduced by Dantchev et al. [2007]. There, the authors show important results on tree-like Parameterized Resolution---a parameterized version of classical Resolution---and their gap complexity theorem implies lower bounds for that system.
The main result of this article significantly improves upon this by showing optimal lower bounds for a parameterized version of bounded-depth Frege. More precisely, we prove that the pigeonhole principle requires proofs of size nΩ(k) in parameterized bounded-depth Frege, and, as a special case, in dag-like Parameterized Resolution. This answers an open question posed in Dantchev et al. [2007]. In the opposite direction, we interpret a well-known technique for FPT algorithms as a DPLL procedure for Parameterized Resolution. Its generalization leads to a proof search algorithm for Parameterized Resolution that in particular shows that tree-like Parameterized Resolution allows short refutations of all parameterized contradictions given as bounded-width CNFs.
- Alekhnovich, M. and Razborov, A. A. 2008. Resolution is not automatizable unless W{P} is tractable. SIAM J. Comput. 38, 4, 1347--1363. Google Scholar
Digital Library
- Beame, P., Karp, R. M., Pitassi, T., and Saks, M. E. 2002. The efficiency of resolution and Davis--Putnam procedures. SIAM J. Comput. 31, 4, 1048--1075. Google Scholar
Digital Library
- Beame, P., Impagliazzo, R., and Sabharwal, A. 2007. The resolution complexity of independent sets and vertex covers in random graphs. Computat. Complex. 16, 3, 245--297. Google Scholar
Digital Library
- Beyersdorff, O., Galesi, N., and Lauria, M. 2011a. Parameterized complexity of DPLL search procedures. In Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 6695, Springer-Verlag, Berlin, 5--18. Google Scholar
Digital Library
- Beyersdorff, O., Galesi, N., Lauria, M., and Razborov, A. 2011b. Parameterized bounded-depth Frege is not optimal. In Proceedings of the 38th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 6755, Springer-Verlag, Berlin, 630--641. Google Scholar
Digital Library
- Bonet, M. L. and Galesi, N. 2001. Optimality of size-width tradeoffs for resolution. Computat. Complex. 10, 4, 261--276. Google Scholar
Digital Library
- Bonet, M. L., Pitassi, T., and Raz, R. 1997. Lower bounds for cutting planes proofs with small coefficients. J. Symb. Logic 62, 3, 708--728.Google Scholar
Cross Ref
- Buss, S. R. 1987. Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Logic 52, 916--927.Google Scholar
Cross Ref
- Buss, S. R. and Pitassi, T. 1997. Resolution and the weak pigeonhole principle. Comput. Sci. Logic. 149--156. Google Scholar
Digital Library
- Chen, Y. and Flum, J. 2008. The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Logic 151, 1, 22--61.Google Scholar
Cross Ref
- Cook, S. A. and Reckhow, R. A. 1979. The relative efficiency of propositional proof systems. J. Symb. Logic 44, 1, 36--50.Google Scholar
Cross Ref
- Dantchev, S. S., Martin, B., and Szeider, S. 2007. Parameterized proof complexity. In Proceedings of the 48th IEEE Symposium on the Foundations of Computer Science. 150--160. Google Scholar
Digital Library
- Downey, R. G. and Fellows, M. R. 1999. Parameterized Complexity. Springer-Verlag, Berlin. Google Scholar
Digital Library
- Eickmeyer, K., Grohe, M., and Grüber, M. 2008. Approximation of natural W{P}-complete minimisation problems is hard. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, 8--18. Google Scholar
Digital Library
- Flum, J. and Grohe, M. 2003. Describing parameterized complexity classes. Inf. Computat. 187, 2, 291--319. Google Scholar
Digital Library
- Flum, J. and Grohe, M. 2006. Parameterized Complexity Theory. Springer-Verlag, Berlin Heidelberg. Google Scholar
Digital Library
- Gao, Y. 2009. Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability. Artif. Intell. 173, 14, 1343--1366. Google Scholar
Digital Library
- Haken, A. 1985. The intractability of resolution. Theor. Comput. Sci. 39, 297--308.Google Scholar
Cross Ref
- Krajíček, J., Pudlák, P., and Woods, A. 1995. Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Struct. Algor. 7, 1, 15--39. Google Scholar
Digital Library
- Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press.Google Scholar
- Pitassi, T., Beame, P., and Impagliazzo, R. 1993. Exponential lower bounds for the pigeonhole principle. Computat. Complex. 3, 97--140. Google Scholar
Digital Library
- Pudlák, P. 1997. Lower bounds for resolution and cutting planes proofs and monotone computations. J. Symb. Logic 62, 3, 981--998.Google Scholar
Cross Ref
- Raz, R. 2004. Resolution lower bounds for the weak pigeonhole principle. J. ACM 51, 2, 115--138. Google Scholar
Digital Library
- Razborov, A., Wigderson, A., and Yao, A. 2002. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. Combinatorica 22, 4, 555--574. Google Scholar
Digital Library
- Razborov, A. A. 2004. Resolution lower bounds for perfect matching principles. J. Comput. Syst. Sci. 69, 1, 3--27. Google Scholar
Digital Library
- Riis, S. 2001. A complexity gap for tree resolution. Computat. Complex. 10, 3, 179--209.Google Scholar
Cross Ref
Index Terms
Parameterized Bounded-Depth Frege Is not Optimal
Recommendations
Parameterized bounded-depth Frege is not optimal
ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part IA general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution--a parameterized version of classical Resolution--and their gap complexity ...
Non-Automatizability of Bounded-Depth Frege Proofs
COCO '99: Proceedings of the Fourteenth Annual IEEE Conference on Computational ComplexityIn this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the Diffie-Hellman function is sufficiently ...
Non-automatizability of bounded-depth frege proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the Diffie-Hellman function is sufficiently ...






Comments