paranp (317B)
1 # ParaNP 2 3 From https://simonrey.fr/static/talks/PCT_Hardness.pdf 4 - def: [parameterized_language] for which there is a nondeterministic [turing_machine] that takes as input (x, k), runs in [fpt] time f(k) x^c for some c, 5 and decides membership 6 - [fpt] = paraNP iff [ptime] = [nptime] 7 8 Up: [parameterized_complexity]