New applications of the incompressibility method (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 220-229

  Buhrman, Harry ^a   Jiang, Tao ^b   Li, Ming ^c   Vitányi, Paul ^a  

^a CWI   (Netherlands)

^b MCMASTER UNIVERSITY   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

AVERAGE CASE; EXTENDED ABSTRACTS; KOLMOGOROV COMPLEXITY; LOWER BOUNDS; NEW APPLICATIONS; NEW RESULTS;

AUTOMATA THEORY;

EID: 84887444291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_19     Document Type: Conference Paper

References (23)

1. L. Alexanderson, L.F. Klosinski and L.C. Larson, The William Lowell Putnam Mathematical Competition, Problems and Solutions: 1965-1984, Mathematical Association of America, Washington, DC, 1985.
2. L. Alonso, E. Reingold and R. Schott, Determining the majority, Information Processing Letters 47, 1993, pp. 253-255.
3. L. Alonso, E. Reingold and R. Schott, The average-case complexity of determining the majority, SIAM Journal on Computing 26, 1997, pp. 1-14.
4. N. Alon, J.H. Spencer and P. Erdos, The Probabilistic Method, Wiley, 1992.
5. H. Buhrman, M. Li, J. Tromp and P.M.B. Vitanyi, Kolmogorov Random Graphs and the Incompressibility Method, SIAM J. Comput, To appear.
6. G.J. Chaitin, On the number of N-bit strings with maximum complexity, Applied Mathematics and Computation, 59(1993), 97-100.
7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Proc. of 19th ACM Symp. on Theory of Computing, 1987, pp. 1-6.
8. C. Domingo, O. Watanabe, T. Yamazaki, A role of constraint in self-organization, Proc. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM98), LNCS, Springer-Verlag, Heidelberg, 1998, To appear.
9. P. Erdos and J.H. Spencer, Probabilistic Methods in Combinatorics, Academic Press, 1974.
10. W. Feller, An Introduction to Probability Theory and Its Applications, Vols. 1, 2, Second Edition, Wiley, 1957.
11. D.H. Greene and D.E. Knuth, Mathematics for the Analysis of Algorithms, 3rd ed., Birkhauser, Boston, MA, 1990.
12. T. Jiang, M. Li, P. Vitanyi, Average-Case Complexity of Shellsort, in these Proceedings.
13. M. Li and P.M.B. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, 2nd Edition, 1997.
14. M. Li and P.M.B. Vitanyi, Kolmogorov complexity arguments in combinatorics, J. Comb. Th., Series A, 66:2(1994), 226-236.
15. M. Li and P.M.B. Vitanyi, Kolmogorov complexity arguments in combinatorics, J. Comb. Th., Series A 69(1995), 183.
16. A.I. Khinchine, Fundamenta Mathematicae, 6(1924), 9-20.
17. A.N. Kolmogorov, Three approaches to the quantitative definition of information. Problems Inform. Transmission, 1(1):1-7, 1965.
18. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge Univ. Press, 1997.
19. R. Niedermeier, K. Reinhardt, and P. Sanders, Towards optimal locality in Mesh- Indexings. Proc. FCT'97, LNCS Vol 1279, Springer-Verlag, 1997, pp. 364-375.
20. P. O'Neil and E. O'Neil. A fast expected time algorithm for boolean matrix multiplication and transitive closure. Information and Control 22, 1973, pp. 132-138.
21. N. Nisan, Personal communication, 30 Dec. 1998: \I'm not sure where this exercise was proved nor do I remember the details of the proof, but the idea was to take into account the sizes of rectangles when counting the discrepancy on the rectangle.".
22. P. Revesz, Random Walk in Random and Non-Random Environments, World Scientic, Singapore, 1990.
23. M.E. Saks and M. Werman, On computing majority by comparisons, Combinatorica 11, 1991, pp. 383-387.