Computability and Complexity Theory

Computability and Complexity Theory

Оценок пока нет
2013 · Английский · Kindle · Изданий: 5
Добавить на полку

Оценить эту книгу


Экспортировать журнал книг

Описание

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.

Детали книги

Формат Kindle
Страницы 207 страниц
Язык Английский
Опубликовано янв 1, 2013
Издатель SPRINGER
Издание 1
Издания Изданий: 5
ISBN-10 1475735448
ISBN-13 9781475735444
Добавить на полку

Оценить эту книгу


Экспортировать журнал книг