The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations, and the efficiency of the computations. It provides tools to measure the difficulty of combinatorial problems both absolutely, and in comparison with other problems. This book contains material that should be core knowledge in the theory of computation for all graduate students in computer science. This comprehensive introduction begins with classical computability theory and develops complexity theory on top of that.
Computability and Complexity Theory
Steven Homer, Alan L. Selman
Springer
2001
207 páginas
6h 54m
ISBN-10: 0387950559
Estatísticas
Avaliações
0 / 0- 5 estrelas0%
- 4 estrelas0%
- 3 estrelas0%
- 2 estrelas0%
- 1 estrelas0%