Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01503491n
Noun Named Entity
SYL
No term available
EN
In computational complexity theory, the class NC is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. Wikipedia
English:
class
complexity
Relations
Sources
IS A
EN
complexity class
HAS PART
EN
TC
EN
AC
PART OF
EN
TC
p
EN
AC
SAID TO BE THE SAME AS
EN
TC
EN
AC

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