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.This book contains material that should be core knowledge in the theory of computation for all graduate students in computer science.

Title | : | Computability and Complexity Theory |

Author | : | Steven Homer, Alan L. Selman |

Publisher | : | Springer Science & Business Media - 2001-01-01 |

Continue