Author:
Buhrman Harry,Vitányi Paul,Jiang Tao,Li Ming
Publisher
Springer Berlin Heidelberg
Reference22 articles.
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-1, 1997, pp. 1–14.
4. N. Alon, J.H. Spencer and P. Erdös, The Probabilistic Method, Wiley, 1992
5. H. Buhrman, M. Li, J. Tromp and P.M.B. Vitányi, Kolmogorov Random Graphs and the Incompressibility Method, SIAM J. Comput, To appear.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Incompressibility Method;SOFSEM 2000: Theory and Practice of Informatics;2000