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
Рональд Л. Грэхем, Дональд Э. Кнут, Орен Паташник
Publisher
Издательский дом "Вильяме"
Year
2010
Language
Russian
52
Rate this book

To read the book, log in / register

Preview fragment

Similar books

Discrete Mathematics: Graphs, Matroids, Algorithms

Discrete Mathematics: Graphs, Matroids, Algorithms

М. О. Асанов, В. А. Баранский, В. В. Расин

The Elements of Differentiable Programming

The Elements of Differentiable Programming

Mathieu Blondel, Vincent Roulet

Surreal Numbers

Surreal Numbers

Дональд Эрвин Кнут

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

Дмитрий Голубенко, Алексей Крошнин, Эдуард Горбунов

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

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

Дональд Э. Кнут

Grokking Algorithms

Grokking Algorithms

Автор не указан в предоставленном фрагменте

Mathematics in Cybersecurity Research

Mathematics in Cybersecurity Research

Paul L. Goethals, Natalie M. Scala, Daniel T. Bennett (редакторы)

Concurrency Explained

Concurrency Explained

Кирилл Бобров

Introduction to Algorithms, Fourth Edition

Introduction to Algorithms, Fourth Edition

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