A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

Sander Gribling, Sven Polak, Lucas Slot. A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. In Alicia Dickenstein, Elias P. Tsigaridas, Gabriela Jeronimo, editors, Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023. pages 280-288, ACM, 2023. [doi]

@inproceedings{GriblingPS23,
  title = {A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization},
  author = {Sander Gribling and Sven Polak and Lucas Slot},
  year = {2023},
  doi = {10.1145/3597066.3597075},
  url = {https://doi.org/10.1145/3597066.3597075},
  researchr = {https://researchr.org/publication/GriblingPS23},
  cites = {0},
  citedby = {0},
  pages = {280-288},
  booktitle = {Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023},
  editor = {Alicia Dickenstein and Elias P. Tsigaridas and Gabriela Jeronimo},
  publisher = {ACM},
}