50 search results - page 10 / 10 » Quantum query complexity of minor-closed graph properties |
JAR
2000
13 years 5 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
BMCBI
2006
13 years 5 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
DIMACS
1996
13 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...