On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Formula Isomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems: Refining Schaefer's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query evaluation by search-tree revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal algebra and hardness results for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equivalence and isomorphism of systems of equations over finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of database queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subalgebra Intersection Property for Congruence Distributive Varieties / rank
 
Normal rank

Latest revision as of 23:50, 5 July 2024

scientific article
Language Label Description Also known as
English
On the expression complexity of equivalence and isomorphism of primitive positive formulas
scientific article

    Statements

    On the expression complexity of equivalence and isomorphism of primitive positive formulas (English)
    0 references
    0 references
    0 references
    0 references
    6 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    primitive positive formulas
    0 references
    equivalence
    0 references
    isomorphism
    0 references
    computational complexity
    0 references
    clones
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references