Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity

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.

Abstract

Abstract is missing.