Stefan S. Dantchev, Barnaby Martin, Stefan Szeider. Parameterized Proof Complexity. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings. pages 150-160, IEEE Computer Society, 2007. [doi]
@inproceedings{DantchevMS07, title = {Parameterized Proof Complexity}, author = {Stefan S. Dantchev and Barnaby Martin and Stefan Szeider}, year = {2007}, doi = {10.1109/FOCS.2007.52}, url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.52}, researchr = {https://researchr.org/publication/DantchevMS07}, cites = {0}, citedby = {0}, pages = {150-160}, booktitle = {48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings}, publisher = {IEEE Computer Society}, }