Košík
zboží
(prázdné)
Kontakt
Účet
Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural aspects of the P=NP...
číst celé
Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural aspects of the P=NP question, parallel computation, and more.
schovat popis
- Nakladatel: Pearson Education (US)
- Kód:
- Rok vydání: 1993
- Jazyk: Angličtina
- Vazba: Gebunden
- Počet stran: 544
- Šířka balení: 17.1 cm
- Výška balení: 24.6 cm
- Hloubka balení: 3 cm
- Váha balení: 860 g
Recenze