Parameterized problems complete for nondeterministic FPT time and logarithmic space
Let XNLP be the class of parameterized problems such that an instance of size n with parameter k can be solved nondeterministically in time f(k)nO(1) and space f(k)log(n) (for some computable function f). We give a wide variety of XNLP-complete problems, such as List Coloring and Precoloring Extens...
Saved in:
| Published in: | Information and computation Vol. 300; p. 105195 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.10.2024
|
| ISSN: | 0890-5401 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!