Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information Processing Letters
A note on the number of N-bit strings with maximum complexity
Applied Mathematics and Computation
Kolmogorov complexity arguments in combinatorics
Journal of Combinatorial Theory Series A
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Communication complexity
Kolmogorov Random Graphs and the Incompressibility Method
SIAM Journal on Computing
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Role of Constraint in Self-Organization
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Towards Optimal Locality in Mesh-Indexings
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
| Hi-index | 0.00 |
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it is particularly suited to obtain average-case computational complexity lower bounds. Such lower bounds have been difficult to obtain in the past by other methods. In this paper we present four new results and also give four new proofs of known results to demonstrate the power and elegance of the new method.