BOOK-CHAPTER

Lower Bounds via Kolmogorov Complexity

Keywords:
Kolmogorov complexity Mathematical proof Kolmogorov structure function Mathematics Upper and lower bounds Discrete mathematics Computer science Mathematical analysis Geometry

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
7
Refs
0.02
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Computability, Logic, AI Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Benford’s Law and Fraud Detection
Physical Sciences →  Mathematics →  Statistics and Probability
semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

BOOK-CHAPTER

Lower Bounds Using Kolmogorov Complexity

Sophie Laplante

Lecture notes in computer science Year: 2006 Pages: 297-306
BOOK-CHAPTER

Lower bounds by kolmogorov-complexity

Ming Li

Lecture notes in computer science Year: 2005 Pages: 383-393
BOOK-CHAPTER

Lower Bounds for Levin–Kolmogorov Complexity

Nicholas Brandt

Lecture notes in computer science Year: 2024 Pages: 191-221
BOOK-CHAPTER

When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

Eric Allender

Lecture notes in computer science Year: 2001 Pages: 1-15
JOURNAL ARTICLE

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

Sophie LaplanteFrédéric Magniez

Journal:   SIAM Journal on Computing Year: 2008 Vol: 38 (1)Pages: 46-62
© 2026 ScienceGate Book Chapters — All rights reserved.