Content deleted Content added
→W[t]: fix the definition |
|||
Line 1:
In [[computer science]], '''parameterized complexity''' is a branch of [[computational complexity theory]] that focuses on classifying [[computational problems]] according to their inherent difficulty with respect to ''multiple'' parameters of the input. The complexity of a problem is then measured as a [[Function (mathematics)|function]] in those parameters. This allows to classify [[NP-hard]] problems on a finer scale than in the classical setting, where the complexity of a problem is only measured by the number of bits in the [[Input (computer science)|input]].
The first systematic work on parameterized complexity was done by {{harvtxt|Downey|Fellows|1999}}.
| |||