- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Technical Reports ; TR-2006-017
- Keyword
-
NP-hartes Problem ; Komponente ; Lebendigkeit
- Event
-
Veröffentlichung
- (where)
-
Mannheim
- (who)
-
Universitätsbibliothek Mannheim
- (when)
-
2006
- Creator
-
Martens, Moritz
Minnameier, Christoph
Majster-Cederbaum, Mila
- URN
-
urn:nbn:de:bsz:180-madoc-13166
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:55 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Martens, Moritz
- Minnameier, Christoph
- Majster-Cederbaum, Mila
- Universitätsbibliothek Mannheim
Time of origin
- 2006
Other Objects (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