2 search results - page 1 / 1 » Quantum Shortest Path Netsukuku |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...