Skip to main content
Conference Proceedings

Generic expression hardness results for primitive positive formula comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6756 LNCS(PART 2) 344-355
DOI: 10.1007/978-3-642-22012-8_27
1Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Bova, S., Chen, H., & Valeriote, M. (2011). Generic expression hardness results for primitive positive formula comparison. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 344–355). https://doi.org/10.1007/978-3-642-22012-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free