28 search results - page 1 / 6 » On the Query Complexity of Testing Orientations for Being Eu... |
APPROX
2008
Springer
13 years 6 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 ...
XSYM
2005
Springer
13 years 10 months ago
2005
Springer
XQuery is a feature-rich language with complex semantics. This makes it hard to come up with a benchmark suite which covers all performance-critical features of the language, and a...
MKWI
2008
13 years 6 months ago
2008
: Language offers human beings the ability to exchange information. Whether the information is understood or not depends on the structure, complexity and knowledge of the language....
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...