Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03433111n
Noun Concept
Categories: Parameterized complexity, Computational complexity theory, Articles with short description
EN
parameterized complexity  FPT  W  XP  W-Hierarchy
EN
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. Wikipedia
Definitions
Sources
EN
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. Wikipedia
Branch of computational complexity theory Wikidata
Wikipedia
EN
parameterized complexity
Wikidata
EN
Parameterized complexity
Wikipedia Redirections
EN
Fixed-parameter algorithm, Fixed-parameter tractability, fixed-parameter tractable, FPT (class), parameterised complexity, Parameterized (Multivariate) Complexity, Parameterized Complexity, Parametrised complexity, parametrized complexity, W(1), W-Hierarchy, W-hierarchy, W hierarchy, XP (class)

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License