Periodic constraint satisfaction problems: Tractable subclasses (Q816674)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5009055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Periodic constraint satisfaction problems: Tractable subclasses |
scientific article; zbMATH DE number 5009055 |
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
0.9849094152450562
0 references
0.8230921626091003
0 references
0.8184661865234375
0 references
0.8167164325714111
0 references
0.8097089529037476
0 references
