Bootstrapping variables in algebraic circuits

DOI10.1145/3188745.3188762zbMath1427.68356OpenAlexW2808849451MaRDI QIDQ5230371

Sumanta Ghosh, Nitin Saxena, Manindra Agrawal

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3188745.3188762

zbMATH Keywords

lower boundderandomizationidentity testingdepth-4hitting-setdepth-3\#P/polycircuit factoring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (3)

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ Unnamed Item ⋮ Unnamed Item

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