Название: Computability and Complexity Theory, 2nd Edition Автор: Steven Homer, Alan L. Selman Издательство: Springer Год: 2011 ISBN: 1461406811 / 9781461406815 Серия: Texts in Computer Science Формат: pdf Страниц: 300 Размер: 10,4 mb Язык: English
The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:
• a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp?Lipton. • a chapter studying properties of the fundamental probabilistic complexity classes • a study of the alternating Turing machine and uniform circuit classes. • an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda • a thorough treatment of the proof that IP is identical to PSPACE
With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool.
Foundations of Machine Learning, Second Edition Название: Foundations of Machine Learning, Second Edition Автор: Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar Издательство: The MIT Press...
Algorithmic Randomness and Complexity Название: Algorithmic Randomness and Complexity Автор: Rodney G. Downey, Denis R. Hirschfeldt Издательство: Springer Год: 2010 Формат: PDF Страниц:...
Group Theory and Quantum Mechanics Название: Group Theory and Quantum Mechanics Автор: Michael Tinkham Издательство: Dover Publications Год: 2003 Формат: PDF Страниц: 352 Размер: 37,67...
Feynman Lectures on Computation Название: Feynman Lectures on Computation Автор: Richard P. Feynman Издательство: Addison-Wesley Год: 1996 ISBN: 0201489910 Формат: pdf Страниц: 303...
The Annotated Turing Название: The Annotated Turing Автор: Charles Petzold Издательство: John Wiley & Sons Год: 2008 Формат: PDF Размер: 12 Мб Язык: английский /...
Информация
Посетители, находящиеся в группе Гости, не могут оставлять комментарии к данной публикации.
Навигация
Вход на сайт
Реклама
Computability and Complexity Theory 
