Concrete Mathematics
| Also known as |
- Add other possible names for this topic
Concrete Mathematics: A Foundation for Computer Science, by Ronald Graham, Donald Knuth, and Oren Patashnik, is a perennial textbook in university computer science departments. It provides the mathematical background for computer science, especially the analysis of algorithms. While some of the topics in Concrete Mathematics are similar to those covered by traditional Discrete Mathematics textbooks, the authors have a unique approach to the subject matter: They explain in the preface that concrete mathematics "is a blend of CONtinuous and disCRETE mathematics," and calculus is frequently used in the explanations and exercises. The term is also used to denote the opposite of abstract mathematics.
The book is based on a course originally taught in 1970 by Knuth at Stanford University. It expands on the material in the "Mathematical Preliminaries" section of Knuth's The Art of Computer Programming. Consequently, some readers use it as an introduction to that famous series of books.
...
full article at wikipedia
Publishing
| Editions |
| Genre |
| Characters |
| Interior illustrations by |
| Author |
| Editor |
| Date written |
| Copyright date |
| Date of first publication |
| Subjects |
| Original language |
| School or Movement |
| Part of series |
With the exception of Wikipedia summaries and some images the
content on this page is typically distributed under
the Creative Commons
Attribution license or Public Domain.
The original description for this topic was automatically generated from the Wikipedia article "Concrete Mathematics" licensed under the GNU Free Documentation License.
| Gallery | add an image | edit gallery |
Recent Discussions about Concrete Mathematics
There are no conversations on this topic. Would you like to start one?
Start the Discussion