Computational Complexity
3842 Kč
Sleva až 70% u třetiny knih
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.
| Autor: | Papadimitriou Christos H. |
| Nakladatel: | Pearson Education (US) |
| ISBN: | 9780201530827 |
| Rok vydání: | 1993 |
| Jazyk : | Angličtina |
| Vazba: | Hardback |
| Počet stran: | 544 |
Mohlo by se vám také líbit..
-
Combinatorial Optimization
Papadimitriou Christos H.
-
Gottlob Frege: Foundations of Arithm...
Gottlob Frege
-
Clean Architecture
Robert C. Martin
-
Learn More Python 3 the Hard Way
Shaw Zed A.
-
Augmented Reality
Schmalstieg, Dieter; Hollerer, Tobias
-
Light It, Shoot It, Retouch It
Scott Kelby
-
Large-Scale Scrum
CRAIG LARMAN
-
Building Data Centers with VXLAN BGP...
Krattiger, Lukas; Kapadia, Shyam; Jansen, David
-
The Non-Designer's Design Book
Williams Robin
-
Agile IT Organization Design
Narayan, Sriram
-
SQL Queries for Mere Mortals
John L. Viescas
-
Component-Based Rails Applications
Hagemann, Stephan
-
Adobe Photoshop CC Classroom in a Book
Faulkner, Andrew
-
Applying UML and Patterns
CRAIG LARMAN
-
Understanding and Using English Gram...
Hagen Stacy A.
-
System Center Configuration Manager ...
Meyler, Kerrie