Looking for indexed pages…
P Complete Vs Nc Parallel Complexity may refer to:
Use of the terms “P-complete” (P-completeness) and “NC” (Nick’s Class) to discuss relationships between sequential polynomial time and efficient parallel computation.
The parallel complexity class NC, often discussed in contrast with P-complete problems when analyzing what can be solved efficiently in parallel.