arXiv (OAI Expanded)
open access
Randomized query complexity can beat certificate complexity
A long-standing open question in query complexity asks whether there is a total Boolean function f with R(f) << C(f), where R(f) and C(f) denote its bounded-error randomized query complexity and certificate complexity, respectively. We construct a function with R(f) = O~(sqrt{C(f)}), which is optima
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Optimal Separation Between Certificate Complexity and Approximate Degree#799560
- An Optimal Separation Between Certificate Complexity and Approximate Degree#798137
- Certification complexity of Boolean functions#1062682
- Near-Optimal Separations of Certificate Complexity from Randomized and Quantum Query Complexity#1034202
- Hunting a rabbit: Complexity, approximability and some characterizations#347928
Record · ID 1084953
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive