The book is a very up-to-date collection of articles in theoretical computer science, written by leading authorities in the field. The topics range from algorithms and complexity to algebraic specifications, and from formal languages and language-theoretic modeling to computational geometry. The material is based on columns and articles that have appeared in the EATCS Bulletin during the past two to three years. Although very recent research is discussed, the largely informal style of writing makes the book accessible to readers with little or no previous knowledge of the topics.
Part 1 Computational geometry, H. Edelsbrunner et al. Part 2 Algebraic
specification, H. Ehrig et al: on the potential role of algebraic
specification within computer science, H. Ehrig and P. Pepper; linking
schemas and module specifications - a proposal, H. Ehrig and M.A. Arbib; a
short Oxford survey of order sorted algebra, J. Goguen and R. Diaconescu.
Part 3 Logic in comptuer science, Y. Gurevich et al: on Kolmogorov machines
and related issues; Topoi and computation, A. Blass. Part 4 Structural
complexity, J. Hartmanis et al; Goedel, von Neumann and the P=? NP problem;
counting hierarchies - polynomial time and constant depth circuits, E.W.
Allender and K.W. Wagner. Part 5 Formal language theory, A. Salomaa et al;
decidability in finite automata; parallel communicating grammar systems, L.
Santean. (Part contents).
More info about World Scientific e-books