Hochschulschrift
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783662606698
3662606690
- Dimensions
-
24 cm, 629 g
- Extent
-
XI, 398 Seiten
- Language
-
Englisch
- Notes
-
Illustrationen
Technische Universität Wien, Dissertation, 2016
- Bibliographic citation
-
Lecture notes in computer science ; 11880
- Keyword
-
Parametrisierte Komplexität
Komplexitätsklasse
Erfüllbarkeitsproblem
Polynomialzeitalgorithmus
Deklarative Programmierung
- Event
-
Veröffentlichung
- (where)
-
Berlin, Germany
- (who)
-
Springer
- (when)
-
2019
- Creator
- Contributor
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:26 PM 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
- Haan, Ronald de
- Springer-Verlag GmbH
- Springer
Time of origin
- 2019
Other Objects (12)
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
A Parameterized Complexity View on Collapsing k-Cores
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
A Parameterized Complexity View on Collapsing k-Cores
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs