algorithms for parameterized problems where the run-time is polynomial in the input size, but depends arbitrarily on the parameter

The study of algorithms for problems where each instance comes with a complexity parameter, and where the run-time of the algorithm is a fixed polynomial in the instance size, but may depend arbitrarily on the parameter.

history | excerpt history