Uwe Schöning. Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. In Igor Prívara, Peter Ruzicka, editors, Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS 97, Bratislava, Slovakia, August 25-29, 1997, Proceedings. Volume 1295 of Lecture Notes in Computer Science, pages 110-116, Springer, 1997.
@inproceedings{Schoning97:0, title = {Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity}, author = {Uwe Schöning}, year = {1997}, tags = {Kolmogorov complexity}, researchr = {https://researchr.org/publication/Schoning97%3A0}, cites = {0}, citedby = {0}, pages = {110-116}, booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS 97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}, editor = {Igor Prívara and Peter Ruzicka}, volume = {1295}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-63437-1}, }