В книге "Theory of Computational Complexity" (Теория вычислительной сложности) излагаются основные принципы и приложения, необходимые для понимания современной теории вычислительной сложности. Книга рассматривает различные модели вычислений и методы, такие как сложность вычислений, сложность дерева решений, сложность схем и вероятностная сложность. Второе издание книги содержит обновленную информацию на основе новых достижений в области вычислительной сложности и отзывов читателей. В книге также представлены новые разработки в области теории NP-полноты и новые упражнения для проверки понимания материала. Книга является отличным учебным пособием для курсов по теории вычислений и вычислительной сложности на уровне аспирантуры. Она также может быть полезна для исследователей и практиков в областях компьютерных наук, инженерии и математики, использующих современные программные и вычислительные методы для проведения исследований. Книга "Theory of Computational Complexity" является стандартным источником информации по теории вычислительной сложности.
Описание книги: "Theory of Computational Complexity" by Ko Ker-i
This book offers a thorough revision based upon the advances in computational complexity and based on readers' feedback. It presents updates on the principles and application essentials to understand present day computational complexity theory and continues to give comprehensive services to studying computational approach utilization and problems within the solving of algorithmic issues. Among the features of this book are detailed examination of complexity theory fundamentals like computational models, the trial tree's complexity, furnished with circuits, and probability theory.
This newly edited book also contains the updates while telling about areas like the NP-completeness construction, and some unreleased exercises of different levels of difficulties are also added. Along with this, it gets chapter-end review featuring summaries for each topic given and would suggest some sources of further study.
The Theory of Computational complexity is a very good undergraduate degree course for students in utilizing computational theory or those pursuing building up modern software or conducting research in mathematics. This book is a valuable reference for students working in the areas of computer science and engineering who heavily utilize advanced software.
Электронная Книга «Theory of Computational Complexity» написана автором Ko Ker-I в году.
Минимальный возраст читателя: 0
Язык: Английский
ISBN: 9781118593035
Описание книги от Ko Ker-I
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
