A Linear Lower Bound on the Query Complexity of Property Testing Algorithms for 3-Coloring in Bounded-degree Graphs Andrej Bogdanov∗ Kenji Obata†

First Page		Document Content
Date: 2008-09-12 03:56:18		A Linear Lower Bound on the Query Complexity of Property Testing Algorithms for 3-Coloring in Bounded-degree Graphs Andrej Bogdanov∗ Kenji Obata† Add to Reading List Source URL: www.cse.cuhk.edu.hk Download Document from Source Website File Size: 179,71 KB Share Document on Facebook