Rounding sum-of-squares relaxations

DOI10.1145/2591796.2591886zbMath1315.90028arXiv1312.6652MaRDI QIDQ5259536

Jonathan A. Kelner, Boaz Barak, David Steurer

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.6652

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C22: Semidefinite programming

68W25: Approximation algorithms

68Q12: Quantum algorithms and complexity in the theory of computing

Uses Software

• SuLQ