Theory of Computational Complexity Ko Ker-I

Theory of Computational Complexity скачать fb2

Фрагмент книги

0 скачали
0 прочитали
0 впечатлений






Ko Ker-I - Theory of Computational Complexity краткое содержание

Praise for the First Edition «…complete, up-to-date coverage of computational complexity theory…the book promises to become the standard reference on computational complexity.» -Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research. A thorough revision based on advances in the field of computational complexity and readers’feedback, the Second Edition of Theory of Computational Complexity presents updates to theprinciples and applications essential to understanding modern computational complexitytheory. The new edition continues to serve as a comprehensive resource on the use of softwareand computational approaches for solving algorithmic problems and the related difficulties thatcan be encountered.Maintaining extensive and detailed coverage, Theory of Computational Complexity, SecondEdition, examines the theory and methods behind complexity theory, such as computationalmodels, decision tree complexity, circuit complexity, and probabilistic complexity. The SecondEdition also features recent dev

Читать книгу онлайн Theory of Computational Complexity - автор Ko Ker-I или скачать бесплатно и без регистрации в формате fb2. Роман написан в году, в жанре . Читаемые, полные версии книг, без сокращений, на сайте - библиотека бесплатных книг Knigism.online. Вы можете скачать издание полностью и открыть в любой читалке, на свой телефон или айфон, а также читать произведение без интернета.




Скачать книгу «Theory of Computational Complexity» Ko Ker-I

Чтобы оставить свою оценку и/или комментарий, Вам нужно войти под своей учетной записью или зарегистрироваться

Другие книги жанраМатематика
Гильберт. Основания математики
Гильберт. Основания математики
Фон Нейман. Теория игр
Фон Нейман. Теория игр
Игра случая. Математика и мифология совпадения
Игра случая. Математика и мифология...
Математика для мам и пап: Домашка без мучений
Математика для мам и пап: Домашка б...