Deciding the feasibility of a booking in the European gas market is coNP-hard
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9338
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Deciding the feasibility of a booking in the European gas market is coNP-hard ; day:30 ; month:6 ; year:2022 ; pages:1-28
Annals of operations research ; (30.6.2022), 1-28
- Urheber
-
Thürauf, Johannes
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10479-022-04732-1
- URN
-
urn:nbn:de:101:1-2022082109200798668331
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 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
- Thürauf, Johannes
- SpringerLink (Online service)
Ähnliche Objekte (12)
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deciding to distrust
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deciding to distrust
Deciding Liveness in Component-Based Systems is NP-hard
Computing the Interleaving Distance is NP-Hard
Automating Resolution is NP-Hard
Deciding whether a lattice has an orthonormal basis is in co-NP
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
On the benefits of using NP-hard problems in Branch & Bound
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems