Buy 3, pay for 2 — use code TRIPLEUS at checkout.
by NC · tapa dura · ISBN 9789947620809
* 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.
Le Sanglot du Chardonneret es una obra literaria que recopila una serie de relatos cortos, ofreciendo al lector una inmersión profunda en la narrativa breve. Esta edición en tapa dura destaca por su calidad y cuidado, siendo una pieza esencial para los amantes de la literatura francófona que buscan explorar nuevas voces y estilos narrativos.
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).
