Periodic constraint satisfaction problems: Tractable subclasses (Q816674)

From MaRDI portal
Revision as of 12:06, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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