Periodic constraint satisfaction problems: Tractable subclasses (Q816674): Difference between revisions
From MaRDI portal
Latest revision as of 10: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
23 February 2006
0 references
periodic problems
0 references
polynomial-time algorithms
0 references
0 references