Fortell venner om denne varen:
The Complexity Theory Companion - Texts in Theoretical Computer Science: an Eatcs Series Lane A. Hemaspaandra
Pris
NOK 869
Bestillingsvarer
Forventes levert 31. des - 8. jan 2026
Julegaver kan byttes frem til 31. januar
Legg til iMusic ønskeliste
eller
Finnes også 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øker Innbunden bok (Bok med hard rygg og stivt omslag) |
| Utgitt | 1. desember 2001 |
| ISBN13 | 9783540674191 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 385 |
| Mål | 155 × 235 × 22 mm · 707 g |
| Språk | Tysk |
Mer med Lane A. Hemaspaandra
Vis alle![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 (Innbunden 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-innbunden-bok&class=scaled&v=1604041158)
Se alt med Lane A. Hemaspaandra ( f.eks. Pocketbok og Innbunden bok )