Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas-Reference-Cited by-同舟云学术

Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas

Published:2011-10-20 Issue:1 Volume:22 Page:1-38
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Mahajan Meena,Raghavendra Rao B. V.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-011-0024-2.pdf

Reference39 articles.

1. Sanjeev Arora , Boaz Barak (2009) Computational Complexity: A Modern Approach. Cambridge University Press, New York, USA ISBN 0521424267, 9780521424264

2. Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan (2010).On Lower Bounds for Constant Width Arithmetic Circuits. In: ISAAC, Yingfei Dong, Ding-Zhu Du, Oscar Ibarra editors, Lecture Notes in Computer Science, 637–646. Springer Berlin/Heidelberg

3. David A. Mix Barrington (1989) Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. Journal of Computer and System Sciences 38(1): 150–164

4. Lenore Blum, Felipe Cucker, Mike Shub & Steve Smale (1997). Complexity and Real Computation. Springer.

5. Allan Borodin (1977) On Relating Time and Space to Size and Depth. SIAM J. Comput. 6(4): 733–744

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On hard instances of non-commutative permanent;Discrete Applied Mathematics;2020-04

2. On Weak-Space Complexity over Complex Numbers;Fundamentals of Computation Theory;2017

3. On Hard Instances of Non-Commutative Permanent;Lecture Notes in Computer Science;2016

4. Lower Bounds for Non-Commutative Skew Circuits;Theory of Computing;2016

5. On the power of algebraic branching programs of width two;computational complexity;2015-11-05