NC (complexity)
Versandkostenfrei!
Versandfertig in 6-10 Tagen
19,99 €
inkl. MwSt.
PAYBACK Punkte
10 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 an...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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, 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.
Andere Kunden interessierten sich für
