A new tractable class of constraint satisfaction problems (Q1776199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Victor Dalmau / rank
Normal rank
 
Property / author
 
Property / author: Victor Dalmau / rank
 
Normal rank
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/s10472-005-1810-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155002729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems raised from 2-semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Para primal algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plain para primal algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising tractable constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability of quantified formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495111 / 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 sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing constraint satisfaction problems using database techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / 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: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous operations and homogeneous algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint relaxation may be perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimality and global consistency of row-convex constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic arc-consistency algorithm and its specializations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:37, 10 June 2024

scientific article
Language Label Description Also known as
English
A new tractable class of constraint satisfaction problems
scientific article

    Statements

    A new tractable class of constraint satisfaction problems (English)
    0 references
    20 May 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    constraint satisfaction problem
    0 references
    complexity
    0 references
    para-primal algebra
    0 references
    para-primal problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references