The following pages link to (Q5666587):
Displaying 6 items.
- A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)