How low can approximate degree and quantum query complexity be for total Boolean functions?

From MaRDI portal

(Redirected from How low can approximate degree and quantum query complexity be for total Boolean functions?)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=How_low_can_approximate_degree_and_quantum_query_complexity_be_for_total_Boolean_functions%3F&oldid=62214660"