Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
Work
Year: 2016
Type: article
Source: arXiv (Cornell University)
Institutions Wrocław University of Science and Technology, Dalle Molle Institute for Artificial Intelligence Research
Cites:
Cited by: 3
Related to: 20
FWCI: 1.103
Citation percentile (by year/subfield): 50
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: closed