Skip to main navigation
Skip to search
Skip to main content
University of Luebeck Home
English
Deutsch
Home
Research Units
Experts
Publications
Projects
Datasets
Prizes
Spin-Offs
Activities
Media
Search by expertise, name or affiliation
On the Space Complexity of Parameterized Problems
Michael Elberfeld, Christoph Stockhusen,
Till Tantau
Institute of Theoretical Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the Space Complexity of Parameterized Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Space Complexity
100%
Automaton
33%
Proving Completeness
33%
Computational Problem
33%
Mathematics
Complexity Space
100%
Subsequence
33%
Computational Problem
33%
Measure Theory
33%