Black-Box Identity Testing of Depth-4 Multilinear Circuits-Reference-Cited by-同舟云学术

Black-Box Identity Testing of Depth-4 Multilinear Circuits

Published:2017-12-09 Issue:5 Volume:38 Page:1205-1238
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Saraf Shubhangi,Volkovich Ilya

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/article/10.1007/s00493-016-3460-4/fulltext.html

Reference58 articles.

1. M. Anderson, M. A. Forbes, R. Saptharishi, A. Shpilka and B. Lee Volk: Identity testing and lower bounds for read-k oblivious algebraic branching programs, in: 31st Conference on Computational Complexity, CCC 25, 1–30, 2016.

2. M. Agrawal, R. Gurjar, A. Korwar and N. Saxena: Hitting-sets for ROABP and sum of set-multilinear circuits, SIAM J. Comput. 44 (2015), 669–697.

3. M. Agrawal: Proving lower bounds via pseudo-random generators, in: Proceedings of the 25th FSTTCS, volume 3821 of LNCS, 92–105, 2005.

4. M. Agrawal, N. Kayal and N. Saxena: Primes is in P, Annals of Mathematics 160 (2004), 781–793.

5. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and the hardness of approximation problems, JACM 45 (1998), 501–555.

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

1. Linear Independence, Alternants, and Applications;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Guest Column;ACM SIGACT News;2022-06-10

3. Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Polynomial time deterministic identity testing algorithm for Σ [3] ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15