Gabriel Istrate, Adrian Craciun. Proof Complexity and the Kneser-Lovász Theorem. In Carsten Sinz, Uwe Egly, editors, Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Volume 8561 of Lecture Notes in Computer Science, pages 138-153, Springer, 2014. [doi]
@inproceedings{IstrateC14,
title = {Proof Complexity and the Kneser-Lovász Theorem},
author = {Gabriel Istrate and Adrian Craciun},
year = {2014},
doi = {10.1007/978-3-319-09284-3_11},
url = {http://dx.doi.org/10.1007/978-3-319-09284-3_11},
researchr = {https://researchr.org/publication/IstrateC14},
cites = {0},
citedby = {0},
pages = {138-153},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
editor = {Carsten Sinz and Uwe Egly},
volume = {8561},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-09283-6},
}