Author:
Buhrman Harry,Jiang Tao,Li Ming,Vitányi Paul
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
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. Determining the majority;Alonso;Inform. Process. Lett.,1993
3. The average-case complexity of determining the majority;Alonso;SIAM J. Comput.,1997
4. On the number of N-bit strings with maximum complexity;Chaitin;Appl. Math. Comput.,1993
5. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1–6.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献