Quantum Algorithms for Matching and Network Flows
From MaRDI portal
Publication:5449796
DOI10.1007/11672142_13zbMath1136.68395arXivquant-ph/0508205OpenAlexW2120252658MaRDI QIDQ5449796
Robert Špalek, Andris Ambainis
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0508205
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A query-efficient quantum algorithm for maximum matching on general graphs ⋮ Quantum algorithms for matching problems ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ The quantum query complexity of the determinant ⋮ Quantum algorithm for shortest path search in directed acyclic graph
This page was built for publication: Quantum Algorithms for Matching and Network Flows
