A polynomial relational class of binary CSP (Q722101): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2766016802 / 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: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Unanimity Constraints Have Bounded Pathwidth Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal coarse-grained arc consistency algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability in constraint satisfaction problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc consistency and friends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain permutation reduction for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal k-consistency algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction over connected row-convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / 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: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank

Latest revision as of 05:06, 16 July 2024

scientific article
Language Label Description Also known as
English
A polynomial relational class of binary CSP
scientific article

    Statements

    A polynomial relational class of binary CSP (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    tractable language
    0 references
    polymorphism
    0 references
    constraint satisfaction problem
    0 references
    majority operations
    0 references
    0 references