arXiv (OAI Expanded)
open access
Direct sum theorems beyond query complexity
A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in several research fields. Despite its importance, however, little
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
- Distributional Variants of the Aaronson-Ambainis Conjecture#1129919
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
- A Polynomial time Algorithm for 3SAT#158580
- Topics in Mathematics of Data Science#3607
- Irreversibility and Complexity#108327
Record · ID 1083975
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