- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Technical Reports ; TR-2006-017
- Schlagwort
-
NP-hartes Problem ; Komponente ; Lebendigkeit
- Ereignis
-
Veröffentlichung
- (wo)
-
Mannheim
- (wer)
-
Universitätsbibliothek Mannheim
- (wann)
-
2006
- Urheber
-
Martens, Moritz
Minnameier, Christoph
Majster-Cederbaum, Mila
- URN
-
urn:nbn:de:bsz:180-madoc-13166
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 MEZ
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
- Martens, Moritz
- Minnameier, Christoph
- Majster-Cederbaum, Mila
- Universitätsbibliothek Mannheim
Entstanden
- 2006
Ähnliche Objekte (12)
Deadlock-Detection in Component-Based Systems is NP-hard.
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Component based tailorability
Intersection optimization is NP-complete
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Component based tailorability
Intersection optimization is NP-complete
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
Computing technical capacities in the European entry-exit gas market is NP-hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Component based tailorability
Intersection optimization is NP-complete