Skip to search formSkip to main contentSkip to account menu

Kolmogorov complexity

Known as: K-complexity, Entropy (disambiguation), Chaitin–Kolmogorov randomness 
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Nonlinear differential equations have applications in the modelling area for a broad variety of phenomena and physical processes… 
2011
2011
Accounting for the Reynolds number is critical in numerical simulations of turbulence, particularly for subsonic flow. For… 
2010
2010
Image similarity measurement is a fundamental and common issue in a broad range of problems in image processing, compression… 
Highly Cited
2009
Highly Cited
2009
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh… 
2007
2007
Aims. We determine the properties of the Faraday screen and the magnetic field near the central region of the Galaxy. Methods. We… 
2006
2006
We derive recurrences for counting the number a(n,r) of sequences of length n with Lempel-Ziv complexity r, which has important… 
Highly Cited
2001
Highly Cited
2001
There is a strong trend toward embedding Internet capabilities into electronics and everyday appliances. We introduce the results… 
1997
1997
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming…