On the power of algebraic branching programs of width two-Reference-Cited by-同舟云学术

On the power of algebraic branching programs of width two

Published:2015-11-05 Issue:1 Volume:25 Page:217-253
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Allender Eric,Wang Fengming

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-015-0114-7.pdf

Reference18 articles.

1. Agrawal M, Allender E, Datta S (2000) On TC0, AC0, and Arithmetic Circuits. Journal of Computer and System Sciences 60: 395–421

2. M. Agrawal, R. Gurjar, A. Korwar & N. Saxena (2015).Hitting- Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM Journal on Computing 44(3), 669–697. doi: 10.1137/140975103 .

3. E. Allender (2004). Arithmetic Circuits and Counting Complexity Classes. In Complexity of Computations and Proofs, J. Krajíček, editor, volume 13 of Quaderni di Matematica, 33–72. Seconda Università di Napoli.

4. A. Ambainis, E. Allender, D. A. M. Barrington, S. Datta & H. LêThanh (1999). Bounded Depth Arithmetic Circuits: Counting and Closure. In Proc. ICALP, number 1644 in Lecture Notes in Computer Science, 149–158. Springer.

5. D. A. Barrington (1985). Width-3 Permutation Branching Programs. Technical Report Technical Memorandum MIT/LCS/TM-293, MIT.

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

1. Hitting Sets for Orbits of Circuit Classes and Polynomial Families;ACM Transactions on Computation Theory;2024-09-10

2. Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. On The Closures of Monotone Algebraic Classes and Variants of the Determinant;Algorithmica;2024-03-25

4. Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. A note on VNP-completeness and border complexity;Information Processing Letters;2022-06