Lesson plan
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. In other words, a problem with input size n is NC if there exist constants c and k such that it can be solved in time using 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. As in the case of circuit complexity theory, usually the class has an extra constraint that the circuit family must be uniform (see below). Equivalently, NC can be defined as those decision problems decidable by a uniform Boolean circuit (which can be calculated from the length of the input, for NC, we suppose we can compute the Boolean circuit of size n in logarithmic space in n) with polylogarithmic depth and a polynomial number of gates with a maximum fan-in of 2. RNC is a class extending NC with access to randomness.
Article summary
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. In other words, a problem with input size n is NC if there exist constants c and k such that it can be solved in time using 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. As in the case of circuit complexity theory, usually the class has an extra constraint that the circuit family must be uniform (see below). Equivalently, NC can be defined as those decision problems decidable by a uniform Boolean circuit (which can be calculated from the length of the input, for NC, we suppose we can compute the Boolean circuit of size n in logarithmic space in n) with polylogarithmic depth and a polynomial number of gates with a maximum fan-in of 2. RNC is a class extending NC with access to randomness.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.