| Home : Concepts : Data Structure |
| Click "Subscribe" if you want to be notified of new or updated links in this category. | Subscribe |
|
|
Data Structure Listings
|
|
Total:
60 | Displaying: 21 - 30 | Pages: << 1 2 3 4 5 6 >> |
|
|
|
Algorithms and Complexity
Updated: 02/20/2005
|
|
|
Cellular Automata and Complexity
Updated: 02/20/2005
|
|
|
Parallel Complexity Theory
Updated: 02/20/2005
|
|
|
A Course in Universal Algebra
Updated: 02/20/2005
|
|
|
Practical Foundations of Mathematics
Updated: 02/20/2005
|
|
|
Implementing Mathematics with The Nuprl Proof System
Updated: 02/20/2005
|
|
|
this book is about computers, graphics, and learning, as opposed to computer graphics for learning. There is a difference. This book considers and integrates a broad spectrum of information related to the instructional design of visual information for learning and how the computer supports this process. Another way to understand the distinction is to first consider the importance of the three topics independently and then how they relate to each other. The title lists the topics in order from least to most important, so we must start with the last topic — learning — and work our way forward. This is also the order that must be considered when making design decisions involving visualization techniques.
Updated: 02/20/2005
|
|
|
This book presents the final version of Chaitin's course on the limits of mathematical reasoning. This course uses algorithmic information theory to show that mathematics has serious limitations, and features a new more didactic approach to algorithmic information theory using LISP and Mathematica software. The thesis of the book is that the incompleteness phenomenon discovered by Gödel is much more widespread and serious than hitherto suspected. Also Gödel and Einstein's views on the foundations of mathematics are discussed, and it is suggested that mathematics is quasi-empirical and that experimental mathematics should be used more freely
Updated: 02/20/2005
|
|
|
Matroid Decomposition
Updated: 02/20/2005
|
|
|
This book is intended as a reference for professional cryptographers, presenting the techniques and algorithms of greatest interest to the current practitioner, along with the supporting motivation and background material. It also provides a comprehensive source from which to learn cryptography, serving both students and instructors. In addition, the rigorous treatment, breadth, and extensive bibliographic material should make it an important reference for research professionals
Updated: 02/20/2005
|
|
|
Data Structure Listings
|
|
Total:
60 | Displaying: 21 - 30 | Pages: << 1 2 3 4 5 6 >> |
|
|
