An Algebraic Theory of Complexity for Discrete Optimization (Q5396951): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071152266 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1207.6692 / rank | |||
Normal rank | |||
Latest revision as of 02:50, 20 April 2024
scientific article; zbMATH DE number 6254888
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algebraic Theory of Complexity for Discrete Optimization |
scientific article; zbMATH DE number 6254888 |
Statements
An Algebraic Theory of Complexity for Discrete Optimization (English)
0 references
4 February 2014
0 references
Galois connections
0 references
constraint optimization
0 references
discrete optimization
0 references
valued constraint satisfaction problem
0 references
weighted polymorphisms
0 references
weighted clones
0 references
complexity of valued constraint languages
0 references
