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.
-
Learn More Python 3 the Hard Way
Shaw Zed A.
-
SQL Queries for Mere Mortals
John L. Viescas
-
Prolog Programming for Artificial In...
Bratko, Ivan
-
C++ in 24 Hours, Sams Teach Yourself
Rogers Cadenhead
-
IoT Fundamentals
Hanes, David; Salgueiro, Gonzalo; Grossetete, Patrick; Barton, Robert; Henry, Jerome
-
Documenting Software Architectures
Clements, Paul
-
The Truthful Art
Cairo, Alberto
-
Principles of Concurrent and Distrib...
Faridi, Ben
-
Fundamentals of Game Design
Adams, Ernest
-
Applying UML and Patterns
CRAIG LARMAN
-
Core Java Volume I--Fundamentals, 1
Horstmann Cay S.
-
HTML, CSS, and JavaScript All in One
Meloni, Julie C.
-
Writing Effective Use Cases
Alistair Cockburn
-
Advanced Game Design
Sellers, Michael
-
Games, Design and Play
Macklin, Colleen; Sharp, John