Explore relationships

NC (complexity)

In computational 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.

Use + to expand a branch. Click a topic name to open its summary.