Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
Abstract

Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In

Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Self-Improvement for Circuit-Analysis ProblemsProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit FactoringProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply $$\text{VP} \neq \text{VNP}$$computational complexity, Vol. 33, No. 1 | 16 April 2024
- Lower Bounds for the Sum of Small-Size Algebraic Branching ProgramsTheory and Applications of Models of Computation | 3 May 2024
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under FactoringJournal of the ACM, Vol. 69, No. 3 | 11 June 2022
- Demystifying the border of depth-3 algebraic circuits2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- Blackbox identity testing for sum of special ROABPs and its border classcomputational complexity, Vol. 30, No. 1 | 10 June 2021
- Derandomization from Algebraic Hardness: Treading the Borders2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2019
- Bootstrapping variables in algebraic circuitsProceedings of the National Academy of Sciences, Vol. 116, No. 17 | 11 April 2019
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].