Pages that link to "Item:Q832903"
From MaRDI portal
The following pages link to A query-efficient quantum algorithm for maximum matching on general graphs (Q832903):
Displaying 5 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Graph comparison via nonlinear quantum search (Q2105947) (← links)
- Quantum Algorithms for Matching and Network Flows (Q5449796) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902000) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)