ISTA Publications
metadata only
Query-complexity amplification for random oracles
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
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
- Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity#1062565
- Property Testing for Recursive Query Languages#926776
- Enabling Data Dependency-based Query Optimization#158629
- Oracle problems as communication tasks and optimization of quantum algorithms#924405
Record · ID 334373
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