Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. (Q4598218): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
label / en | label / en | ||
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963033151 / rank | |||
Normal rank | |||
Property / title | |||
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. (English) | |||
Property / title: Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. (English) / rank | |||
Normal rank |
Revision as of 09:10, 30 July 2024
scientific article; zbMATH DE number 6820267
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. |
scientific article; zbMATH DE number 6820267 |
Statements
19 December 2017
0 references
SoS/Lasserre hierarchy
0 references
lift and project methods
0 references
binary polynomial optimization
0 references
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. (English)
0 references