- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Kontinen, J.; Mahmood, Y.; Meier, A.; Vollmer, H.: Parameterized complexity of weighted team definability. In: Mathematical Structures in Computer Science (2024), online first. DOI: https://doi.org/10.1017/s0960129524000033
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover
- (when)
-
2024
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Technische Informationsbibliothek (TIB)
- (when)
-
2024
- Creator
-
Kontinen, Juha
Mahmood, Yasir
Meier, Arne
Vollmer, Heribert
- DOI
-
10.15488/17150
- URN
-
urn:nbn:de:101:1-2404250228541.976118708519
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
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.
Associated
- Kontinen, Juha
- Mahmood, Yasir
- Meier, Arne
- Vollmer, Heribert
- Gottfried Wilhelm Leibniz Universität Hannover
- Technische Informationsbibliothek (TIB)
Time of origin
- 2024
Other Objects (12)
Parameterized complexity
Parameterized Complexity of Diameter
Parameterized complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Complexity and approximability of parameterized MAX-CSPs
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 of Diameter
Parameterized complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Complexity and approximability of parameterized MAX-CSPs
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 of Diameter
Parameterized complexity theory
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Complexity and approximability of parameterized MAX-CSPs
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
On the space and circuit complexity of parameterized problems