165 search results - page 12 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
COCOON
2000
Springer
13 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
CP
2007
Springer
14 years 1 months ago
2007
Springer
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
DBPL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...