BOOK-CHAPTER
Resolution proofs, exponential bounds, and Kolmogorov complexity
Year: 1997 Lecture notes in computer science Pages: 110-116 Publisher: Springer Science+Business Media
Keywords:
Mathematical proof Expander graph Exponential function Upper and lower bounds Computer science Resolution (logic) Context (archaeology) Argument (complex analysis) Set (abstract data type) Base (topology) Discrete mathematics Kolmogorov complexity Mathematics Algorithm Graph Artificial intelligence Geometry
Metrics
8
Cited By
2.00
FWCI (Field Weighted Citation Impact)
14
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Computability, Logic, AI Algorithms
Physical Sciences → Computer Science → Computational Theory and Mathematics
Logic, Reasoning, and Knowledge
Physical Sciences → Computer Science → Artificial Intelligence
Logic, programming, and type systems
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
JOURNAL ARTICLE
Complexity bounds on proofs
William HatcherBernard R. Hodgson
Journal: Journal of Symbolic Logic Year: 1981 Vol: 46 (2)Pages: 255-258
BOOK-CHAPTER
Lower bounds by kolmogorov-complexity
Lecture notes in computer science Year: 2005 Pages: 383-393
BOOK-CHAPTER
Lower Bounds Using Kolmogorov Complexity
Lecture notes in computer science Year: 2006 Pages: 297-306