On the complexity of binary polynomial optimization over acyclic hypergraphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

On the Complexity of Binary Polynomial Optimization Over Acyclic HypergraphsAlberto Del Pia, Silvia Di Gregorio. algorithmica, 85(8):2189-2213, August 2023. [doi]

runs on WebDSL