%0 Conference Paper %1 conf/sat/IstrateC14 %A Istrate, Gabriel %A Craciun, Adrian %B SAT %D 2014 %E Sinz, Carsten %E Egly, Uwe %I Springer %K dblp %P 138-153 %T Proof Complexity and the Kneser-Lovász Theorem. %U http://dblp.uni-trier.de/db/conf/sat/sat2014.html#IstrateC14 %V 8561 %@ 978-3-319-09283-6

@inproceedings{conf/sat/IstrateC14, added-at = {2017-05-23T00:00:00.000+0200}, author = {Istrate, Gabriel and Craciun, Adrian}, biburl = {https://www.bibsonomy.org/bibtex/255642b9222280037e48d3abf00a7df38/dblp}, booktitle = {SAT}, crossref = {conf/sat/2014}, editor = {Sinz, Carsten and Egly, Uwe}, ee = {https://doi.org/10.1007/978-3-319-09284-3_11}, interhash = {7610aa67454c619ab0524b2cd31b31e4}, intrahash = {55642b9222280037e48d3abf00a7df38}, isbn = {978-3-319-09283-6}, keywords = {dblp}, pages = {138-153}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:11:22.000+0200}, title = {Proof Complexity and the Kneser-Lovász Theorem.}, url = {http://dblp.uni-trier.de/db/conf/sat/sat2014.html#IstrateC14}, volume = 8561, year = 2014 }