Sciweavers

76 search results - page 16 / 16
» On the colored Tutte polynomial of a graph of bounded treewi...
Sort
View
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
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...
Georg Gottlob, Nicola Leone, Francesco Scarcello