On the complexity of binary polynomial optimization over acyclic hypergraphs

Alberto Del Pia, Silvia Di Gregorio. On the complexity of binary polynomial optimization over acyclic hypergraphs. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2684-2699, SIAM, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.