Incompressibility method

The incompressibility method is a proof method such as the probabilistic method, the counting method, or the pigeonhole principle. The method… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
02419772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
1. Introduction. What makes one object more complex than another? Kolmogorov complexity, or program-size complexity, provides one… (More)
Is this relevant?
2009
2009
We reveal a connection between the incompressibility method and the Lovász local lemma in the context of Ramsey theory. We obtain… (More)
  • figure 1
Is this relevant?
2000
2000
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas [8]. To… (More)
Is this relevant?
2000
2000
Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is… (More)
Is this relevant?
1999
1999
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov… (More)
Is this relevant?
1999
1999
  • HARRY BUHRMANy
  • 1999
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information… (More)
Is this relevant?
1999
1999
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information… (More)
  • table 1
  • figure 1
Is this relevant?
1998
1998
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas [11]. To… (More)
Is this relevant?
1997
1997
  • HARRY BUHRMANy, MING LIz, JOHN TROMPx
  • 1997
We investigate topological, combinatorial, statistical, and enumeration properties of nite graphs with high Kolmogorov complexity… (More)
Is this relevant?
Review
1997
Review
1997
We compare the incompressibility method of Kolmogorov complexity that is used in formal proofs of mathematical and computational… (More)
Is this relevant?