Parameterized complexity
id:
parameterized-complexity-166-1867388
title:
Parameterized complexity
text:
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 or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number
brand slug:
wiki
category slug:
encyclopedia
description:
Branch of computational complexity theory
original url:
https://en.wikipedia.org/wiki/Parameterized_complexity
date created:
2004-04-18T00:12:57Z
date modified:
2024-08-29T17:34:31Z
main entity:
{"identifier":"Q1570441","url":"https://www.wikidata.org/entity/Q1570441"}
image:
fields total:
13
integrity:
15