External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on