On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: Algorithmica. 85,S. 2189-2213

Event: Veröffentlichung

(where): Dresden

(who): Technische Universität Dresden

(when): 2024

Creator: Del Pia, Alberto
Di Gregorio, Silvia

URN: urn:nbn:de:bsz:14-qucosa2-892018

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:48 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Del Pia, Alberto
Di Gregorio, Silvia
Technische Universität Dresden

Time of origin

2024

Other Objects (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

Hochschulschrift

Quasi-random hypergraphs and extremal problems for hypergraphs

Stable stellar configurations with polynomial complexity factor

zweidimensionales bewegtes Bild

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

Hochschulschrift

Quasi-random hypergraphs and extremal problems for hypergraphs

Stable stellar configurations with polynomial complexity factor

zweidimensionales bewegtes Bild

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

Hochschulschrift

Quasi-random hypergraphs and extremal problems for hypergraphs

Stable stellar configurations with polynomial complexity factor

zweidimensionales bewegtes Bild

Traces of Hypergraphs

Quasirandomness in hypergraphs

Drawing layered hypergraphs

Interaction on hypergraphs

Partitioning billionscale hypergraphs

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read and agree to the privacy policy for the collection of personal data.*

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs

Show object

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (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

Partitioning billionscale hypergraphs

Related objects

Reset password