Theory of Computational Complexity PDF ePub eBook

Books Info:

Theory of Computational Complexity free pdf 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 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.

About Ding-Zhu Du

DING-ZHU DU, PhD, is Professor in the Department of Computer Science at the University of Texas at Dallas. He has published over 180 journal articles in his areas of research interest, which include design and analysis of approximation algorithms for combinatorial optimization problems and communication networks. Dr. Du is also the coauthor of Problem Solving in Automata, Languages, and Complexity, also published by Wiley. KER-I KO, PhD, is Professor in the Department of Computer Science at National Chiao Tung University, Taiwan. He has published extensively in his areas of research interest, which include computational complexity theory and its applications to numerical computation. Dr. Ko is also the coauthor of Problem Solving in Automata, Languages, and Complexity, also published by Wiley.


Details Book

Author : Ding-Zhu Du
Publisher : John Wiley
Data Published : 11 July 2014
ISBN : 1118306082
EAN : 9781118306086
Format Book : PDF, Epub, DOCx, TXT
Number of Pages : 512 pages
Age + : 15 years
Language : English
Rating :

Reviews Theory of Computational Complexity



17 Comments Add a comment




Related eBooks Download


  • Computational Complexity free pdfComputational Complexity

    This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms..


  • New Computational Paradigms free pdfNew Computational Paradigms

    This superb exposition of a complex subject examines new developments in the theory and practice of computation from a mathematical perspective. with topics ranging from classical computability to complexity..


  • Computational Statistics free pdfComputational Statistics

    The Role of the Computer in Statistics David Cox Nuffield College. Oxford OXIINF. U.K. A classification of statistical problems via their computational demands hinges on four components (I) the amount and complexity of the data..


  • Computational Methods for Electromagnetic and Optical Systems, Second Editi ... free pdfComputational Methods for Electromagnetic and Optical Systems, Second Editi ...

    This text introduces and examines a variety of spectral computational techniques - including k-space theory. Floquet theory and beam propagation - that are used to analyze electromagnetic and optical problems..


  • Introduction to Computational Science free pdfIntroduction to Computational Science

    Computational science is a quickly emerging field at the intersection of the sciences. computer science. and mathematics because much scientific investigation now involves computing as well as theory and experiment..


  • Theory of Computational Complexity free pdfTheory 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 MAT