THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/bsl.2015.25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2285982983 / 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 Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Theory of Complexity for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meditations on Quantified Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: CD(4) has bounded width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and importance of logspace-MOD class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties Obeying Homotopy Laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong Mal'cev condition for locally finite varieties omitting the unary type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems raised from 2-semilattices / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Mal'tsev Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems for weakly symmetric operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded width problems and algebras / 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: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with few subalgebras of powers / rank
 
Normal rank

Latest revision as of 15:17, 11 July 2024

scientific article
Language Label Description Also known as
English
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
scientific article

    Statements

    THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (English)
    0 references
    0 references
    21 March 2016
    0 references
    constraint satisfaction problem
    0 references
    universal algebra
    0 references
    0 references

    Identifiers

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