50 search results - page 4 / 10 » Quantum query complexity of minor-closed graph properties |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
111
click to vote
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
CCCG
2004
14 years 11 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...