Reconstruction of non-degenerate homogeneous depth three circuits-Reference-Cited by-同舟云学术

Reconstruction of non-degenerate homogeneous depth three circuits

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Kayal Neeraj¹,Saha Chandan²

Affiliation:

1. Microsoft Research, India

2. Indian Institute of Science, India

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316360

Reference55 articles.

1. Arithmetic Circuits: A Chasm at Depth Four

2. Dana Angluin. 1988. Dana Angluin. 1988.

3. Queries and Concept Learning. Machine Learning. 2 4 (1988) 319–342. 10.1023/A:1022821128753 Queries and Concept Learning. Machine Learning. 2 4 (1988) 319–342. 10.1023/A:1022821128753

4. Nikhil Balaji Nutan Limaye and Srikanth Srinivasan. 2016. Nikhil Balaji Nutan Limaye and Srikanth Srinivasan. 2016.

5. An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electronic Colloquium on Computational Complexity (ECCC) 23 (2016) 143. An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electronic Colloquium on Computational Complexity (ECCC) 23 (2016) 143.

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

1. Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond;computational complexity;2023-08-03

2. Polynomial-Time Power-Sum Decomposition of Polynomials;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. Derandomization and absolute reconstruction for sums of powers of linear forms;Theoretical Computer Science;2021-10

4. Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. Learning sums of powers of low-degree polynomials in the non-degenerate case;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11