Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (Q4608591)
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 6851865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. |
scientific article; zbMATH DE number 6851865 |
Statements
21 March 2018
0 references
computational complexity
0 references
constraint satisfaction problems
0 references
integer expressions and circuits
0 references
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (English)
0 references
0.92099607
0 references
0.9202259
0 references
0.9183739
0 references
0.9183739
0 references
0.9180072
0 references
0.91598696
0 references
0.91393995
0 references
0.9125384
0 references
0 references
