This comprehensive compendium of algorithms and data structures covers many theoretical issues from a practical perspective. Chapters include information on finite precision issues as well as discussions on specific algorithms where algorithmic techniques are of special importance - for example, algorithms for drawing graphs, algorithms for robotics, and algorithms for forming a VLSI chip. Unique coverage includes graph algorithms, cryptography, parallelism, computational geometry, combinatorial optimization, and computability and complexity theory.

Скачать книгу бесплатно (djvu, 11.05 Mb)

---

Читать «Algorithms and theory of computation handbook»