Tipsa dina vänner om produkten:
The Complexity Theory Companion - Texts in Theoretical Computer Science: an Eatcs Series Lane A. Hemaspaandra
Pris
SEK 839
Beställningsvara
Förväntad leverans 5 - 9 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
eller
Finns även som:
The Complexity Theory Companion - Texts in Theoretical Computer Science: an Eatcs Series
Lane A. Hemaspaandra
An algorithmically oriented guide to some of the most interesting techniques of complexity theory. It shows that simple algorithms are at the heart of complexity theory. It contains chapters each of which focuses on one technique: what it is, and what results and applications it yields.
385 pages, biography
| Media | Böcker Inbunden Bok (Inbunden bok med hårda pärmar och skyddsomslag) |
| Releasedatum | 1 december 2001 |
| ISBN13 | 9783540674191 |
| Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sidor | 385 |
| Mått | 155 × 235 × 22 mm · 707 g |
| Språk | Tyska |
Fler produkter med Lane A. Hemaspaandra
Visa alla![Cover for Lane A. Hemaspaandra · Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series (Pocketbok) [Softcover reprint of the original 1st ed. 2003 edition] (2010)](https://imusic.b-cdn.net/images/item/original/810/9783642075810.jpg?lane-a-hemaspaandra-2010-theory-of-semi-feasible-algorithms-monographs-in-theoretical-computer-science-an-eatcs-series-pocketbok&class=scaled&v=1408467133)
![Cover for Lane A. Hemaspaandra · Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series (Inbunden Bok) [2003 edition] (2002)](https://imusic.b-cdn.net/images/item/original/006/9783540422006.jpg?lane-a-hemaspaandra-2002-theory-of-semi-feasible-algorithms-monographs-in-theoretical-computer-science-an-eatcs-series-inbunden-bok&class=scaled&v=1604041158)
Se alt med Lane A. Hemaspaandra ( t.ex. Inbunden Bok och Pocketbok )