Bootstrapping variables in algebraic circuits

DOI10.1073/pnas.1901272116zbMath1433.68151OpenAlexW2935851301WikidataQ93039363 ScholiaQ93039363MaRDI QIDQ5218580

Sumanta Ghosh, Nitin Saxena, Manindra Agrawal

Publication date: 4 March 2020

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.1901272116

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (5)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Derandomization from Algebraic Hardness ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class ⋮ Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization

This page was built for publication: Bootstrapping variables in algebraic circuits