Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs Jan 1, 2008· Hang Dinh , Alexander Russell · 0 min read Cite DOI Type 1 Publication Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques Last updated on Jan 1, 2008 ← Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards Jan 1, 2008 Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs Jan 1, 2008 →