- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Theory of Computing Systems (64:7) - Heidelberg : Springer - S. 1158-1182
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2023
- Urheber
-
Bentert, Matthias
Haag, Roman
Hofer, Christian
Koana, Tomohiro
Nichterlein, André
- DOI
-
10.14279/depositonce-18159
- Handle
-
11303/19363
- URN
-
urn:nbn:de:101:1-2023071214080500937395
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
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
- Bentert, Matthias
- Haag, Roman
- Hofer, Christian
- Koana, Tomohiro
- Nichterlein, André
- Technische Universität Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
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
Classic graph problems made temporal - a parameterized complexity analysis
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
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
Classic graph problems made temporal - a parameterized complexity analysis
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
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