arXiv (All)
open access
Quantum Query Complexity of Maximum Degree and its Generalizations
We study the quantum query complexity of several basic graph problems. 1) We prove a tight $Θ(n^{3/2})$ bound for finding a maximum-out-degree vertex in an $n$-vertex tournament, resolving a conjecture of Mande, Paraashar, and Saurabh [FSTTCS'23]. 2) Using the same proof idea, we give a direct proof
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
- Resource-Aware Grover Search for Minimum Vertex Cover#1216627
- Odd Cycle Transversal on $H$-free graphs#1105459
- Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph#1327856
- Quantum Query Lower Bounds for Triangle-Listing and Spanners#1132292
- A sharp bound for the least signless Laplacian eigenvalue of triangle-free graphs#1325399
Record · ID 1298402
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