| Juraj Hromkovi - Computers - 2004 - 313 pages
Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal ... | |
| Christos H. Papadimitriou - Computers - 1994 - 523 pages
The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded ... | |
| Burkhard Monien, Robert Cori - Computers - 1989 - 544 pages
This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989 ... | |
| Samuel Buss, P.J. Scott - Computers - 1990 - 350 pages
A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible ... | |
| Steven Homer, Alan L. Selman - Computers - 2011 - 298 pages
This textbook is intended for use in an introductory graduate course in theoretical computer science. The book presents core knowledge in the theory of computation for all ... | |
| |