Name
Abstract | ||
|---|---|---|
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas (Li and Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer, New york, 1997). To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0304-3975(99)00184-X | Theoretical Computer Science |
Keywords | DocType | Volume |
new application,Average-case analysis of algorithms,Incompressibility method,part II,incompressibility method,Kolmogorov complexity | Journal | 235 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 11 |
PageRank | References | Authors |
0.89 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harry Buhrman | 1 | 1607 | 117.99 |
| Tao Jiang | 2 | 1809 | 155.32 |
| Ming Li | 3 | 5595 | 829.00 |
| Paul Vitányi | 4 | 2130 | 287.76 |