Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Di Gregorio, Silvia"'
Autor:
Del Pia, Alberto, Di Gregorio, Silvia
In this work, we advance the understanding of the fundamental limits of computation for binary polynomial optimization (BPO), which is the problem of maximizing a given polynomial function over all binary points. In our main result we provide a novel
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A89201
https://tud.qucosa.de/api/qucosa%3A89201/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A89201/attachment/ATT-0/
The Binary Polynomial Optimization (BPO) problem is defined as the problem of maximizing a given polynomial function over all binary points. The main contribution of this paper is to draw a novel connection between BPO and the field of Knowledge Comp
Externí odkaz:
http://arxiv.org/abs/2311.00149
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, however, is NP-hard and practically hampered already by the complexity o
Externí odkaz:
http://arxiv.org/abs/2302.04694
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that straddle distinc
Externí odkaz:
http://arxiv.org/abs/2202.08068
Autor:
Del Pia, Alberto, Di Gregorio, Silvia
In this work we advance the understanding of the fundamental limits of computation for Binary Polynomial Optimization (BPO), which is the problem of maximizing a given polynomial function over all binary points. In our main result we provide a novel
Externí odkaz:
http://arxiv.org/abs/2007.05861
Publikováno v:
In Discrete Optimization February 2023 47
Autor:
Del Pia, Alberto, Di Gregorio, Silvia
Publikováno v:
Algorithmica; Aug2023, Vol. 85 Issue 8, p2189-2213, 25p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.