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]
@inproceedings{PiaG22,
title = {On the complexity of binary polynomial optimization over acyclic hypergraphs},
author = {Alberto Del Pia and Silvia Di Gregorio},
year = {2022},
doi = {10.1137/1.9781611977073.105},
url = {https://doi.org/10.1137/1.9781611977073.105},
researchr = {https://researchr.org/publication/PiaG22},
cites = {0},
citedby = {0},
pages = {2684-2699},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}