Parameterized Proof Complexity

Dantchev, Stefan; Martin, Barnaby; Szeider, Stefan

doi:10.1109/FOCS.2007.52

by Stefan Dantchev, Barnaby Martin, Stefan Szeider

Reference:

Parameterized Proof ComplexityStefan Dantchev, Barnaby Martin, Stefan SzeiderProceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press.

Bibtex Entry:

@InProceedings{DantchevMartinSzeider07,
  author = 	 {Stefan Dantchev and Barnaby Martin and Stefan Szeider},
  title = 	 {Parameterized Proof Complexity},
  booktitle =    {Proceedings of the 48th Annual Symposium on Foundations of 
                  Computer Science (FOCS 2007), October 20-23, 2007, 
                  Providence, RI, USA},
  doi = {10.1109/FOCS.2007.52},
pages = 	 {150-160},
  year = 	 2007,
  publisher =    {IEEE Press},
}