Take three and pay for only two with coupon TRIPLEEN
by N. c. · tapa blanda · ISBN 9788487038334
* All our products are carefully inspected to support sustainable culture.
Every product is inspected, cleaned and verified before shipping. If it's not what you expected, we'll refund your money.
Este libro es una biografía de Nerón, publicada en 1988 por Espa-Credit. Grandes Biografías. La edición es en tapa blanda y cuenta con 251 páginas. Ideal para los interesados en la historia del Imperio Romano.
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 in NC if there exist constants c and k such that it can be solved in time O((log n)c) 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. As in the case of circuit complexity theory, usually the class has an extra constraint that the circuit family must be uniform (see below).
