Jisho

×
NC (計算複雑性理論)
Links
Wikipedia definition
1. NC (complexity)​In complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem is in NC if there exist constants c and k such that it can be solved in time O(log n) using O(n) parallel processors. Stephen Cook coined the name "Nick's class" after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size.
Read “NC (complexity)” on English Wikipedia
Read “NC (計算複雑性理論)” on Japanese Wikipedia
Read “NC (complexity)” on DBpedia

Discussions

to talk about this word.