Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NADEZHDA VORONOVA:
All reports by Author Nadezhda Voronova:

TR23-024 | 9th March 2023
Mark Bun, Nadezhda Voronova

Approximate degree lower bounds for oracle identification problems

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically lifts to a quantum communication lower bound for a related function.

We ... more >>>




ISSN 1433-8092 | Imprint