The incompressibility method is a proof method such as the probabilistic method, the counting method, or the pigeonhole principle. The methodâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Holger Arnold
- 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

- Pascal Schweitzer
- Inf. Process. Lett.
- 2009

We reveal a connection between the incompressibility method and the LovÃ¡sz local lemma in the context of Ramsey theory. We obtainâ€¦Â (More)

Is this relevant?

2000

2000

- Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. VitÃ¡nyi
- Theor. Comput. Sci.
- 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

- Tao Jiang, Ming Li, Paul M. B. VitÃ¡nyi
- SOFSEM
- 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

- Harry Buhrman, Ming Li, John Tromp, Paul M. B. VitÃ¡nyi
- SIAM J. Comput.
- 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

- Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. VitÃ¡nyi
- SIAM J. Comput.
- 1999

We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing informationâ€¦Â (More)

Is this relevant?

1998

1998

- Tao Jiang, Ming Li, Paul M. B. VitÃ¡nyi
- ArXiv
- 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?