Generic expression hardness results for primitive positive formula comparison

Authors:
Simone Bova;Hubie Chen;Matthew Valeriote
Affiliations:
Department of Mathematics, Vanderbilt University, Nashville, USA;Facultad de Informática, Universidad del País Vasco, E-20080, San Sebastián, Spain and IKERBASQUE, Basque Foundation for Science, E-48011 Bilbao, Spain;Department of Mathematics & Statistics, McMaster University, Hamilton, Canada
Venue:
Information and Computation
Year:
2013

Citing 12
Cited 0

On the computational complexity of algebra on lattices

SIAM Journal on Computing
On the complexity of database queries

Journal of Computer and System Sciences
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Tractable conservative Constraint Satisfaction Problems

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set

Journal of the ACM (JACM)
Conjunctive query evaluation by search-tree revisited

Theoretical Computer Science
Recent Results on the Algebraic Approach to the CSP

Complexity of Constraints
Constraint Satisfaction Problems of Bounded Width

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Tractability and Learnability Arising from Algebras with Few Subpowers

SIAM Journal on Computing
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.