Concrete Mathematics. Mathematical Foundations of Computer Science
B

Concrete Mathematics. Mathematical Foundations of Computer Science

Mathematics
concrete mathematics computer science algorithms discrete mathematics asymptotic analysis number theory generating functions
Author
Ronald L. Graham, Donald E. Knuth, Oren Patashnik
Publisher
Williams Publishing House
Year
2010
Language
Russian
202
Rate this book

To read the book, log in / register

Preview fragment

Similar books

Discrete Mathematics: Graphs, Matroids, Algorithms

Discrete Mathematics: Graphs, Matroids, Algorithms

M. O. Asanov, V. A. Baransky, V. V. Rasin

The Elements of Differentiable Programming

The Elements of Differentiable Programming

Mathieu Blondel, Vincent Roulet

Surreal Numbers

Surreal Numbers

Donald Ervin Knuth

MATH FOR PROGRAMMING: Learn the Math, Write Better Code

MATH FOR PROGRAMMING: Learn the Math, Write Better Code

Ronald T. Kneusel

Algorithms and Computation Models

Algorithms and Computation Models

Dmitry Golubenko, Alexey Kroshnin, Eduard Gorbunov

The Art of Computer Programming, Volume 4, A. Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4, A. Combinatorial Algorithms, Part 1

Donald E. Knuth

Grokking Algorithms

Grokking Algorithms

The author is not specified in the provided fragment.

Mathematics in Cybersecurity Research

Mathematics in Cybersecurity Research

Paul L. Goethals, Natalie M. Scala, Daniel T. Bennett (Editors)

Concurrency Explained

Concurrency Explained

Kirill Bobrov

Introduction to Algorithms, Fourth Edition

Introduction to Algorithms, Fourth Edition

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein