Abstract
We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. We give 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atserias, A.: Conjunctive Query Evaluation by Search-Tree Revisited. Theoretical Computer ScienceĀ 371(3), 155ā168 (2007)
Barto, L.: CD implies NU (2010) (manuscript)
Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 595ā603 (2009)
Berman, J., Idziak, P., MarkoviÄ, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with Few Subalgebras of Powers. Transactions of the American Mathematical SocietyĀ 362(3), 1445ā1473 (2010)
Bodnarchuk, V., Kaluzhnin, L., Kotov, V., Romov, B.: Galois Theory for Post Algebras. I, II. CyberneticsĀ 5, 243ā252, 531ā539 (1969)
Bova, S., Chen, H., Valeriote, M.: On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory of Computing Systems,, doi:10.1007/s00224-010-9302-7
Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on ComputingĀ 34(3), 720ā742 (2005)
Bulatov, A.: Tractable Conservative Constraint Satisfaction Problems. In: Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 321ā330 (2003)
Bulatov, A.: A Dichotomy Theorem for Constraint Satisfaction Problems on a 3-element Set. Journal of the ACMĀ 53 (2006)
Bulatov, A., Valeriote, M.: Recent Results on the Algebraic Approach to the CSP. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.Ā 5250, pp. 68ā92. Springer, Heidelberg (2008)
Freese, R., McKenzie, R.: Commutator Theory for Congruence Modular Varieties. London Mathematical Society Lecture Note Series, vol.Ā 125. Cambridge University Press, Cambridge (1987)
Geiger, D.: Closed Systems of Functions and Predicates. Pacific Journal of MathematicsĀ 27, 95ā100 (1968)
Hobby, D., McKenzie, R.: The Structure of Finite Algebras. Contemporary Mathematics, vol.Ā 76. American Mathematical Society, Providence (1988); Revised edition: 1996
Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and Learnability Arising from Algebras with Few Subpowers. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, LICS (2007)
Hunt III, H.B., Rosenkrantz, D.J., Bloniarz, P.A.: On the Computational Complexity of Algebra on Lattices. SIAM Journal on ComputingĀ 16(1), 129ā148 (1987)
Kearnes, K., Kiss, E., Valeriote, M.: Minimal Sets and Varieties. Transactions of the American Mathematical SocietyĀ 350(1), 1ā41 (1998)
Kolaitis, P., Vardi, M.: Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System SciencesĀ 61, 302ā332 (2000)
Papadimitriou, C., Yannakakis, M.: On the Complexity of Database Queries. Journal of Computer and System SciencesĀ 58(3), 407ā427 (1999)
Vardi, M.: The Complexity of Relational Query Languages. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bova, S., Chen, H., Valeriote, M. (2011). Generic Expression Hardness Results for Primitive Positive Formula Comparison. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-22012-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22011-1
Online ISBN: 978-3-642-22012-8
eBook Packages: Computer ScienceComputer Science (R0)