Hochschulschrift
Fine-grained complexity analysis of some combinatorial data science problems
- Alternative title
-
Detaillierte Komplexitätsanalyse einiger Kombinatorischer Data-Science-Probleme
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Dissertation, 2018
- Bibliographic citation
-
Foundations of computing ; 12
- Keyword
-
NP-hartes Problem
Berechnungskomplexität
Polynomialzeitalgorithmus
Projektive Geometrie
Visualisierung
Data Mining
Cluster
Maschinelles Lernen
Zeitreihenanalyse
Science
Hardness
Computational complexity
Triangle
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2018
- Creator
- Contributor
-
Niedermeier, Rolf
Friedrich, Tobias
Cygan, Marek
- DOI
-
10.14279/depositonce-7123
- Handle
-
11303/7961
- URN
-
urn:nbn:de:101:1-2018101702004553735214
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:28 AM CEST
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.
Object type
- Hochschulschrift
Associated
- Froese, Vincent
- Niedermeier, Rolf
- Friedrich, Tobias
- Cygan, Marek
- Universitätsverlag der TU Berlin
Time of origin
- 2018
Other Objects (12)
Fine-grained complexity analysis of some combinatorial data science problems
Fine-Grained Complexity of Safety Verification
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
Fine-grained multilayer virtualized systems analysis
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained Distributed Application Monitoring Using LTTng
Fine-grained recognition of plants from images
Fine-grained complexity analysis of some combinatorial data science problems
Fine-Grained Complexity of Safety Verification
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
Fine-grained multilayer virtualized systems analysis
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained Distributed Application Monitoring Using LTTng
Fine-grained recognition of plants from images
Fine-grained complexity analysis of some combinatorial data science problems
Fine-Grained Complexity of Safety Verification
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Fine-grained complexity and algorithm engineering of geometric similarity measures
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
Fine-grained multilayer virtualized systems analysis
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained Distributed Application Monitoring Using LTTng