Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03433111n
Noun Concept
JA
固定パラメータ容易性
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
Sources
Wikidata
JA
固定パラメータ容易性

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