Hesse's Redemption: Efficient Convex Polynomial Programming

Lucas Slot, David Steurer, Manuel Wiedmer. Hesse's Redemption: Efficient Convex Polynomial Programming. In Aditya Bhaskara, Artur Czumaj, editors, Proceedings of the 58th Annual ACM Symposium on Theory of Computing, STOC 2026, Salt Lake City, UT, USA, June 22-26, 2026. pages 410-419, ACM, 2026. [doi]

@inproceedings{SlotSW26,
  title = {Hesse's Redemption: Efficient Convex Polynomial Programming},
  author = {Lucas Slot and David Steurer and Manuel Wiedmer},
  year = {2026},
  doi = {10.1145/3798129.3800760},
  url = {https://doi.org/10.1145/3798129.3800760},
  researchr = {https://researchr.org/publication/SlotSW26},
  cites = {0},
  citedby = {0},
  pages = {410-419},
  booktitle = {Proceedings of the 58th Annual ACM Symposium on Theory of Computing, STOC 2026, Salt Lake City, UT, USA, June 22-26, 2026},
  editor = {Aditya Bhaskara and Artur Czumaj},
  publisher = {ACM},
  isbn = {979-8-4007-2536-4},
}