- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithmica (85:) - Heidelberg : Springer Nature - S. 325-351
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2023
- Urheber
-
Bentert, Matthias
Nichterlein, André
- DOI
-
10.14279/depositonce-17054
- Handle
-
11303/18261
- URN
-
urn:nbn:de:101:1-2023030801040696857867
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 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
- Bentert, Matthias
- Nichterlein, André
- Technische Universität Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity theory
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
On the space and circuit complexity of parameterized problems
Parameterized complexity of decision problems in non-classical logics
Parameterized complexity
Parameterized complexity theory
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
On the space and circuit complexity of parameterized problems
Parameterized complexity of decision problems in non-classical logics
Parameterized complexity
Parameterized complexity theory
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Complexity and approximability of parameterized MAX-CSPs
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
On the space and circuit complexity of parameterized problems