<span>Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer sc
Theoretical Computer Science
โ Scribed by R. E. Mille (auth.), F. Preparata (eds.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2011
- Tongue
- English
- Leaves
- 183
- Series
- C.I.M.E. Summer Schools 68
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.
โฆ Table of Contents
Front Matter....Pages i-iii
Parallel Program Schemata....Pages 5-63
Theory of Automata....Pages 65-96
Computational Complexity of Combinatorial and Graph-Theoretic Problems....Pages 97-184
โฆ Subjects
Operations Research, Management Science; Theory of Computation
๐ SIMILAR VOLUMES
<p>R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.</p>
Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. Th