CS

C.M.F. Swennenhuis

2 records found

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 ...