Derandomization from algebraic hardness: treading the borders

DOI10.1109/FOCS.2019.00018MaRDI QIDQ6944219zbMATH OpenFDO

Authors Ramprasad Saptharishi, Zeyu Guo, Mrinal Kumar, Noam Solomon

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2019.00018

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• Derandomization of quantum algorithm for triangle finding
• A largish sum-of-squares implies circuit hardness and derandomization

This page was built for publication: Derandomization from algebraic hardness: treading the borders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944219)