- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540299523
3540299521
- Maße
-
24 cm : an EATCS series
- Umfang
-
XIII, 493 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturverz. S. 463 - 475
- Klassifikation
-
Mathematik
Informatik
- Schlagwort
-
Parametrisierte Komplexität
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg, New York
- (wer)
-
Springer
- (wann)
-
2006
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 11:37 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
- Flum, Jörg
- Grohe, Martin
- Springer
Entstanden
- 2006
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Complexity in information theory
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Algebraic complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
The complexity theory companion
Computability and complexity theory
Parameterized Complexity of Min-Power Asymmetric Connectivity
Parameterized complexity
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Complexity in information theory
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Algebraic complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
The complexity theory companion
Computability and complexity theory
Parameterized Complexity of Min-Power Asymmetric Connectivity
Parameterized complexity
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Diameter
Complexity in information theory
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
Algebraic complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
The complexity theory companion
Computability and complexity theory