The property of being polynomial for Mal’tsev constraint satisfaction problems (Q3546063): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:12, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The property of being polynomial for Mal’tsev constraint satisfaction problems |
scientific article |
Statements
The property of being polynomial for Mal’tsev constraint satisfaction problems (English)
0 references
18 December 2008
0 references
computational complexity
0 references
CSP
0 references
Mal'tsev operation
0 references
