New applications of the incompressibility method: Part II

Theoretical Computer Science

Volumn 235, Issue 1, 2000, Pages 59-70

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

^a CWI   (Netherlands)

^b University of California Riverside   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Average case analysis of algorithms; Incompressibility method; Kolmogorov complexity

Indexed keywords

EID: 0347968358     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00184-X     Document Type: Article

References (13)

1. L. Alexanderson, L.F. Klosinski, L.C. Larson, The William Lowell Putnam Mathematical Competition, Problems and Solutions, Mathematical Association of America, Washington, DC, 1985, pp. 1965-1984.
2. L. Alonso, E. Reingold, R. Schott, Determining the majority, Inform. Process. Lett. 47 (1993) 253-255.
3. L. Alonso, E. Reingold, R. Schott, The average-case complexity of determining the majority, SIAM J. Comput. 26-1 (1997) 1-14.
4. G.J. Chaitin, On the number of N-bit strings with maximum complexity, Appl. Math. Comput. 59 (1993) 97-100.
5. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1-6.
6. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms, 3rd ed., Birkhäuser, Boston, MA, 1990.
7. T. Jiang, M. Li, P.M.B. Vitányi, New applications of the incompressibility method. Computer Journal 42 (1999) 287-293.
8. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, 2nd ed., Springer, New York, 1997.
9. M. Li, P.M.B. Vitányi, Kolmogorov complexity arguments in combinatorics, J. Combin. Theory Ser. A 66(2) (1994) 226-236. Errata, J. Combin. Theory Ser. A 69 (1995) 183.
10. A.N. Kolmogorov, Three approaches to the quantitative definition of information, Problems Inform. Transmission 1(1) (1965) 1-7.
11. E. Kushilevitz, N. Nisan, Communication Complexity, Cambridge University Press, Cambridge, 1997.
12. P. O'Neil, E. O'Neil. A fast expected time algorithm for boolean matrix multiplication and transitive closure, Inform. and Control 22 (1973) 132-138.
13. M.E. Saks, M. Werman, On computing majority by comparisons, Combinatorica 11 (1991) 383-387.