Author:
Jansen Maurice,Mahajan Meena,Rao B. V. Raghavendra
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference28 articles.
1. Eric Allender, Andris Ambainis, David A.Mix Barrington, Samir Datta & Huong LêThanh (1999). Bounded Depth Arithmetic circuits: Counting and Closure. In International Colloquium on Automata, Languages, and Programming ICALP, ICALP’99, 149–158.
2. David A. Mix Barrington, Neil Immerman & Howard Straubing (1990). On uniformity within NC1. Journal of Computer and System Sciences 41(3), 274–306. ISSN 0022-0000.
3. Michael Ben-Or & Richard Cleve (1992). Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1), 54–58.
4. A. Borodin, A. Razborov & R. Smolensky (1993). On lower bounds for read-k-times branching programs. Comput. Complex. 3(1), 1–18. ISSN 1016-3328.
5. Richard P. Brent (1973). The parallel evaluation of arithmetic expressions in logarithmic time. In Complexity of sequential and parallel numerical algorithms (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, Pa., 1973), 83–102. Academic Press, New York.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. VNP=VP in the multilinear world;Information Processing Letters;2016-02
2. On the power of algebraic branching programs of width two;computational complexity;2015-11-05
3. Algebraic Complexity Classes;Perspectives in Computational Complexity;2014