Author:
Alon Noga,Shpilka Amir,Umans Christopher
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference27 articles.
1. Alon N., Boppana R.B (1987) The monotone circuit complexity of Boolean functions. Combinatorica 7(1): 1–22
2. Zs. Baranyai (1975). On the factorization of the complete uniform hypergraph. In Infinite and finite sets, Proc. Coll. Keszthely, 1973, (A. Hajnal, R. Rado and V.T. Sós, eds.), Colloquia Math. Soc. János Bolyai 10. North-Holland.
3. Bateman M., Katz N.H (2012) New bounds on cap sets. J. of the AMS 25(2): 585–613
4. P. Bürgisser, M. Clausen & M. A. Shokrollahi (1997). Algebraic Complexity Theory. Springer.
5. H. Cohn, R. D. Kleinberg, B. Szegedy & C. Umans (2005). Group-theoretic Algorithms for Matrix Multiplication. In Proceedings of the 46th Annual FOCS, 379–388.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献