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

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]

This author has not been identified. Look up 'Alberto Del Pia' in GoogleThis author has not been identified. Look up 'Silvia Di Gregorio' in Google

runs on WebDSL