NC (complexity) | Wikipedia audio article
This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/NC_(com...)
00:02:39 1 Problems in NC
00:03:39 2 The NC hierarchy
00:06:59 2.1 Open problem: Is NC proper?
00:07:22 3 Barrington's theorem
00:09:08 3.1 Proof of Barrington's theorem
00:09:16 4 Notes
00:10:04 5 References
00:12:14 Proof of Barrington's theorem
00:13:50 (1 2 3 4 5), δ
Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.
Learning by listening is a great way to:
increases imagination and understanding
improves your listening skills
improves your own spoken accent
learn while on the move
reduce eye strain
Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.
Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services...
Other Wikipedia audio articles at:
https://www.youtube.com/results?searc...
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.8536860631486163
Voice name: en-US-Wavenet-A
"I cannot teach anybody anything, I can only make them think."
Socrates
SUMMARY
=======
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(logc n) using O(nk) 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.Just as the class P can be thought of as the tractable problems (Cobham's thesis), so NC can be thought of as the problems that can be efficiently solved on a parallel computer. NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomial-time sequential ones. It is unknown whether NC = P, but most researchers suspect this to be false, meaning that there are probably some tractable problems that are "inherently sequential" and cannot significantly be sped up by using parallelism. Just as the class NP-complete can be thought of as "probably intractable", so the class P-complete, when using NC reductions, can be thought of as "probably not parallelizable" or "probably inherently sequential".
The parallel computer in the definition can be assumed to be a parallel, random-access machine (PRAM). That is a parallel computer with a central pool of memory, and any processor can access any bit of memory in constant time. The definition of NC is not affected by the choice of how the PRAM handles simultaneous access to a single bit by more than one processor. It can be CRCW, CREW, or EREW. See PRAM for descriptions of those models.
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.
RNC is a class extending NC with access to randomness.