The complexity of equality constraint languages (Q929295): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-007-9083-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087215337 / 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: Constraint Satisfaction Problems with Infinite Templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog and Constraint Satisfaction with Infinite Templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Equality Constraint Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Countable Homogeneous Templates / 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: Q3995219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building tractable disjunctive constraints / 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: Local and global relational consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed systems of functions and predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal clones on countable sets that include all permutations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal clones on uncountable sets that include all permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5478078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank

Latest revision as of 11:00, 28 June 2024

scientific article
Language Label Description Also known as
English
The complexity of equality constraint languages
scientific article

    Statements

    The complexity of equality constraint languages (English)
    0 references
    0 references
    0 references
    17 June 2008
    0 references
    Constraint satisfaction
    0 references
    Logic in computer science
    0 references
    Computational complexity
    0 references
    Clones on infinite domains
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references