Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits

DOI10.1137/1.9781611975482.40zbMath1431.68127OpenAlexW2902909509MaRDI QIDQ5236221

Ramprasad Saptharishi, Anamay Tengse, Mrinal Kumar

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.40

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (5)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Derandomization from Algebraic Hardness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class

This page was built for publication: Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits