%0 Conference Paper %1 conf/stacs/ArvindKMT00 %A Arvind, Vikraman %A Köbler, Johannes %A Mundhenk, Martin %A Torán, Jacobo %B STACS %D 2000 %E Reichel, Horst %E Tison, Sophie %I Springer %K dblp %P 314-323 %T Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#ArvindKMT00 %V 1770 %@ 3-540-67141-2

@inproceedings{conf/stacs/ArvindKMT00, added-at = {2017-05-24T00:00:00.000+0200}, author = {Arvind, Vikraman and Köbler, Johannes and Mundhenk, Martin and Torán, Jacobo}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2aca6b998fa5d2535c6beea36ba7b672c/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2000}, editor = {Reichel, Horst and Tison, Sophie}, ee = {https://doi.org/10.1007/3-540-46541-3_26}, interhash = {242b5f5520b3f9a3b273eb17116ea424}, intrahash = {aca6b998fa5d2535c6beea36ba7b672c}, isbn = {3-540-67141-2}, keywords = {dblp}, pages = {314-323}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T16:28:54.000+0200}, title = {Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#ArvindKMT00}, volume = 1770, year = 2000 }