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

First Page	Meta Content
	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 Document Date: 2008-09-12 03:56:18 Open Document File Size: 179,71 KB Share Result on Facebook

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