Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation

From MaRDI portal

Revision as of 15:49, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4636508

Jump to:navigation, search

DOI10.4230/LIPICS.ISAAC.2016.26zbMath1398.68177OpenAlexW2575902789MaRDI QIDQ4636508

Publication date: 19 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2016.26

zbMATH Keywords

adaptivity hardness amplification postselection approximate degree

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ On the Power of Statistical Zero Knowledge

This page was built for publication: Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4636508&oldid=18829037"