| Steven Homer, Alan L. Selman - Computers - 2011 - 300 pages
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The ... | |
| Jan Leeuwen - Algorithms - 1990 - 1003 pages
The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for ... | |
| Daniele Bovet, Pierluigi Crescenzi - Mathematics - 1994 - 282 pages
The aim of this book is to review in a systematic way the most significant results obtained in the study of computational complexity theory. A balanced approach which is partly ... | |
| Gerard Meurant - Mathematics - 2014 - 1003 pages
This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical ... | |
| Neil Immerman - Computers - 1999 - 268 pages
By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel ... | |
| |