parameterized complexity

/P ER0 AE1 M AH0 T ER0 AY0 Z D K AH0 M P L EH0 K S AH0 T IY0/
N
  1. 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 or output.

Translate “parameterized complexity” into another language

Choose a language below to open the translator with English selected as the source language.

🇪🇸Spanish🇫🇷French🇩🇪German🇸🇦Arabic🇨🇳Chinese Simplified🇯🇵Japanese🇮🇳Hindi🇧🇷Portuguese🇷🇺Russian🇰🇷Korean🇮🇹Italian🇹🇷Turkish
See all 248+ languages
Back to Dictionary