Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (Q4608591): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. | |||
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://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#Dose16 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2547722307 / rank | |||
Normal rank | |||
Property / title | |||
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (English) | |||
Property / title: Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (English) / rank | |||
Normal rank |
Latest revision as of 08:59, 30 July 2024
scientific article; zbMATH DE number 6851865
Language | Label | Description | Also known as |
---|---|---|---|
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