Zeitschriftenartikel:
S. Bova, H. Chen, M. Valeriote:
"Generic Expression Hardness Results for Primitive Positive Formula Comparison";
Information and Computation,
Vol. 222
(2013),
S. 108
- 120.
Kurzfassung englisch:
We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to finite relational structures. We present two generic hardness results for the studied problems, and discuss evidence that they are optimal and yield, for each of the problems, a complexity trichotomy.
Schlagworte:
Primitive positive formulas, Conjunctive queries, Equivalence, Computational complexity, Clones
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1016/j.ic.2012.10.008
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.