On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithmica. 85,S. 2189-2213
- Ereignis
-
Veröffentlichung
- (wo)
-
Dresden
- (wer)
-
Technische Universität Dresden
- (wann)
-
2024
- Urheber
-
Del Pia, Alberto
Di Gregorio, Silvia
- URN
-
urn:nbn:de:bsz:14-qucosa2-892018
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Del Pia, Alberto
- Di Gregorio, Silvia
- Technische Universität Dresden
Entstanden
- 2024
Ähnliche Objekte (12)
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
Polynomial kernels for deletion to classes of acyclic digraphs
On the complexity of minimum maximal acyclic matchings
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Stable stellar configurations with polynomial complexity factor
Traces of Hypergraphs
Quasirandomness in hypergraphs
Drawing layered hypergraphs
Interaction on hypergraphs
Partitioning billionscale hypergraphs
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
Polynomial kernels for deletion to classes of acyclic digraphs
On the complexity of minimum maximal acyclic matchings
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Stable stellar configurations with polynomial complexity factor
Traces of Hypergraphs
Quasirandomness in hypergraphs
Drawing layered hypergraphs
Interaction on hypergraphs
Partitioning billionscale hypergraphs
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
Polynomial kernels for deletion to classes of acyclic digraphs
On the complexity of minimum maximal acyclic matchings
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
Blocks of hypergraphs : applied to hypergraphs and outerplanarity
Quasi-random hypergraphs and extremal problems for hypergraphs
Stable stellar configurations with polynomial complexity factor
Traces of Hypergraphs
Quasirandomness in hypergraphs
Drawing layered hypergraphs
Interaction on hypergraphs