Buy 3, pay for 2 — use code TRIPLEUS at checkout.
Hand-checked
Free SHIPPING
Second life
Sanglot du Chardonneret
by NC · · tapa dura
6 people viewing thisViewed 1 times
4.6
Pages: 120 pagesAuthor: NCPublisher: Publisher to be confirmedFormat: tapa duraLanguage: frRelease date: 1/7/2015ISBN: ISBN 9789947620809
Choose the condition
What each condition includes
Acceptable — heavy use; complete and functionalVisible marks on cover. Complete, intact content and inspected.
Good — clearly used but complete and fully usableLight marks on cover. Clean pages and spine in good shape.
Very Good — minimal, barely noticeable wearBarely noticeable marks. Pristine interior. Almost no signs of use.
Like New — no visible signs of useNo visible marks. Cover, spine and pages flawless.
New — sealed / brand newBrand-new book, unused. Ordered directly from the publisher.
New condition items ship with free shipping on orders from $15. All other conditions always include free shipping with no minimum order.
* All our products are carefully inspected to support sustainable culture.
Hamelyn quality guarantee
Every product is inspected, cleaned and verified before shipping. If it's not what you expected, we'll refund your money.
Complete your 3-for-2 with NC
Add 3 and the cheapest one is free
Napoleón Bonaparte
$16.86
Biblioteca de Oro de la Cocina. Técnicas Básicas. Volumen 0
$16.86
El caballo de ébano y otros cuentos de Las mil y una noches
$16.86
Redes sociales
$16.86
Synopsis of Sanglot du Chardonneret
Colección de cuentos del autor NC, publicado por Casbah en tapa dura. Los cuentos exploran temas de la vida cotidiana con una sensibilidad particular.
More titles for people who read Sanglot du Chardonneret
Recommended by Julia
About the author
NC
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).
11 titles published
View full profileBest-selling books in Literatura y Ficción
Best sellers
Take 3, pay for only 2 · TRIPLEUS
-
VAT included