Sum of Squares Bounds for the Empty Integral Hull Problem-Reference-Cited by-同舟云学术

Sum of Squares Bounds for the Empty Integral Hull Problem

Published:2023-07-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Kurpisz Adam¹^ORCID,Wirth Elias²^ORCID

Affiliation:

1. BFH, Switzerland and ETH, Switzerland

2. TU Berlin, Germany

Funder

Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy ð The Berlin Mathematics Research Center MATH+

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3597066.3597098

Reference48 articles.

1. S. Arora , S. Rao , and U. V. Vazirani . 2009. Expander flows, geometric embeddings and graph partitioning. JACM 56, 2 ( 2009 ), 5:1–5:37. S. Arora, S. Rao, and U. V. Vazirani. 2009. Expander flows, geometric embeddings and graph partitioning. JACM 56, 2 (2009), 5:1–5:37.

2. A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

3. B. Barak , J. A. Kelner , and D. Steurer . 2015. Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method . In STOC 2015 , Portland, OR, USA , June 14-17, 2015 . 143–151. B. Barak, J. A. Kelner, and D. Steurer. 2015. Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. In STOC 2015, Portland, OR, USA, June 14-17, 2015. 143–151.

4. B. Barak and A. Moitra . 2016. Noisy Tensor Completion via the Sum-of-Squares Hierarchy . In COLT 2016 , New York, USA , June 23-26, 2016 . 417–445. B. Barak and A. Moitra. 2016. Noisy Tensor Completion via the Sum-of-Squares Hierarchy. In COLT 2016, New York, USA, June 23-26, 2016. 417–445.

5. B. Barak P. Raghavendra and D. Steurer. 2011. Rounding Semidefinite Programming Hierarchies via Global Correlation. In FOCS. 472–481. B. Barak P. Raghavendra and D. Steurer. 2011. Rounding Semidefinite Programming Hierarchies via Global Correlation. In FOCS. 472–481.