Looking for indexed pages…
Nc Nicks Class Parallel Complexity Decision Problems may refer to:
NC is the class of decision problems solvable by uniform Boolean circuits with polylogarithmic depth and polynomial size, capturing efficiently parallelizable computation.
A less-standardly referenced term sometimes used in parallel complexity discussions to denote a particular subclass or variant related to NC decision problems (exact meaning depends on the source).
The family of decision problems characterized by membership in NC, often studied in relation to circuit depth and parallel algorithms.