Periodic constraint satisfaction problems: polynomial-time algorithms (Q5897197)
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 5676648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Periodic constraint satisfaction problems: polynomial-time algorithms |
scientific article; zbMATH DE number 5676648 |
Statements
Principles and Practice of Constraint Programming – CP 2003 (English)
0 references
2 March 2010
0 references
0.9849094152450562
0 references
0.8163588047027588
0 references
0.8137447237968445
0 references
0.8105849623680115
0 references
