The property of being polynomial for Mal’tsev constraint satisfaction problems (Q3546063): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10469-006-0035-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067565196 / rank | |||
Normal rank | |||
Latest revision as of 19:59, 19 March 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
