Rigid matrices from rectangular PCPs or: hard claims have complex proofs

DOI10.1109/FOCS46700.2020.00084MaRDI QIDQ6943971zbMATH OpenFDO

Authors Amey Bhangale, Avishay Tal, Prahladh Harsha, Orr Paradise

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00084

Mathematics Subject Classification ID

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

Cited in

(5)

• Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
• Alphabet reduction for reconfiguration problems
• Range avoidance for low-depth circuits and connections to pseudorandomness
• Efficient construction of rigid matrices using an NP oracle
• Nondeterministic quasi-polynomial time is average-case hard for \textsf{ACC} circuits

This page was built for publication: Rigid matrices from rectangular PCPs or: hard claims have complex proofs

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