Parameterized proof complexity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 150-160

  Dantchev, Stefan ^a   Martin, Barnaby ^a   Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS;

(001) PARAMETER; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS; PROOF COMPLEXITY; PROOF SYSTEMS; TRUTH ASSIGNMENT;

COMPUTER SCIENCE;

EID: 46749097216     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389488     Document Type: Conference Paper

References (13)

1. S. R. Buss and T. Pitassi. Resolution and the weak pigeonhole principle. In CSL '97: Selected Papers from the 11th International Workshop on Computer Science Logic, Lecture Notes in Computer Science 1414, Springer (1998) 149-156
2. Cesati, M.: Compendium of parameterized problems. http://bravo.ce.uniroma2.it/home/cesati/research/compendium.pdf (September 2006)
3. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for vertex cover. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Computer Science 4162, Springer (2006) 238-249
4. S. A. Cook and R. A. Reckhow. The relative efficiency of propositional proof systems. J. Symbolic Logic, 44(1)(1979) 36-50
5. S. Dantchev and B. Martin and S. Szeider, Parameterized proof complexity: a complexity gap for parameterized tree-like resolution. Electronic Colloquium on Computational Complexity (ECCC), Technical Report TR07-001 (2007)
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)
7. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoretical Computer Science 141(1-2) (1995) 109-131
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer (2006)
9. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. of Computer and System Sciences 63(4) (2001) 512-530
10. Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, New York, NY, USA (1995)
11. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press (2006)
12. Pudlák, P.: Proofs as Games. American Mathematical Monthly, 107(6) (2000) 541-550
13. Riis, S.: A complexity gap for tree-resolution. Computational Complexity 10(3) (2001) 179-209