Periodic constraint satisfaction problems: Tractable subclasses (Q816674): 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/s10601-005-0551-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038688206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of maximal constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising tractable 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: Q4495111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tractable class of 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: Q4542577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140457 / 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: Constraints and universal algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 11:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Periodic constraint satisfaction problems: Tractable subclasses
scientific article

    Statements

    Periodic constraint satisfaction problems: Tractable subclasses (English)
    0 references
    0 references
    0 references
    23 February 2006
    0 references
    0 references
    periodic problems
    0 references
    polynomial-time algorithms
    0 references
    0 references