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.
-
Clean Architecture
Robert C. Martin
-
Learn More Python 3 the Hard Way
Shaw Zed A.
-
Light It, Shoot It, Retouch It
Scott Kelby
-
Designing Connected Content
Hane, Carrie; Atherton, Mike
-
Learn Adobe Illustrator CC for Graph...
Chelius, Chad; Schwartz, Rob
-
Augmented Reality
Schmalstieg, Dieter; Hollerer, Tobias
-
Natural Resource and Environmental E...
Perman, Roger; Ma Yue; McGilvray, James; Common, Michael S.; Maddison, David
-
Agile IT Organization Design
Narayan, Sriram
-
Design for How People Learn
JULIE DIRKSEN
-
The Design and Implementation of the ...
McKusick, Marshall Kirk; Neville-Neil, George V.
-
SQL Queries for Mere Mortals
John L. Viescas
-
Learn Python 3 the Hard Way
Shaw Zed A.
-
SysML Distilled
Delligatti, Lenny
-
Logo Design Love
David Airey
-
CUDA for Engineers
Storti, Duane; Yurtoglu, Mete