Amanote Research
Register
Sign In
Combinatorial Interpretation of Kolmogorov Complexity
doi 10.1109/ccc.2000.856743
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
A. Romashchenko
A. Shen
N. Vereshchagin
Publisher
IEEE Comput. Soc
Related search
Kolmogorov Complexity and Algorithmic Randomness
Mathematical Surveys and Monographs
A Strange Application of Kolmogorov Complexity
Theory of Computing Systems
Computational Theory
Theoretical Computer Science
Mathematics
Nonreducible Descriptions for the Conditional Kolmogorov Complexity
Problems of Information Transmission
Computer Networks
Computer Science Applications
Information Systems
Communications
Time-Bounded Kolmogorov Complexity and Solovay Functions
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Bounds on the Kolmogorov Complexity Function for Infinite Words
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Neural Complexity: A Graph Theoretic Interpretation
Physical Review E
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
