In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" problems in the complexity class.
Preferred languages to be displayed in the selection menus
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