The study of the computational complexity of problems with respect to more than one parameter.

Parameterized complexity is the study of the computational complexity of problems with respect to more than one parameter, with the idea of isolating those parameters that might contribute to the intrinsic complexity of the problem. For more info, visit the parameterized complexity wiki.

history | excerpt history