Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World
 
Computational Complexity: A Modern Approach
Want to measure length or width of any objects on the earth? Try GIS Visualizer.
  • Title Computational Complexity: A Modern Approach
  • Author(s) Sanjeev Arora, Boaz Barak
  • Publisher: Cambridge University Press; 1 edition (April 20, 2009); eBook (Drafts of the Book)
  • Hardcover 594 pages
  • eBook Online, HTML and PDF files
  • Language: English
  • ISBN-10: 0521424267
  • ISBN-13: 978-0521424264
  • Share This:  

Book Description

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a textbook. More than 300 exercises are included.

Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.

About the Authors
  • Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.
  • Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.
Reviews, Ratings, and Recommendations: Related Book Categories: Read and Download Links: Similar Books:
  • Mathematics and Computation (Avi Wigderson)

    This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

  • Think Complexity: Science and Modeling, 2nd Ed. (Allen Downey)

    This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. It presents features that make Python such a simple and powerful language. Code with a solution for each exercise.

  • Algorithms and Complexity (Herbert S. Wilf)

    This is an introductory book on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis.

  • Computability and Complexity: From a Programming Perspective

    This book is an introduction to the basic concepts of computability, complex, and the theory of programming languages. Its goal is to build a bridge between computability and complexity theory and other areas of computer science, especially programming.

  • Quantum Computing Since Democritus (Scott Aaronson)

    This book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics.

  • Traveling Salesman Problem, Theory and Applications

    This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem, including Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm.

  • The Complexity of Boolean Functions (Ingo Wegener)

    Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. It presents a large number of recent research results f Boolean functions previously unavailable in book form.

  • Computational Complexity (Wikibooks)

    This book contains material that should be core knowledge in the theory of computation for all graduates in computer science. It starts with classical computability theory which forms the basis for complexity theory.

  • Computational Complexity: A Conceptual Perspective (Goldreich)

    This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study.

  • P, NP, and NP-Completeness: The Basics of Complexity

    The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.

Book Categories
:
Other Categories
Resources and Links