• Title: Mathematics and Computation: A Theory Revolutionizing Technology and Science
• Author(s) Avi Wigderson
• Publisher: Princeton University Press (October 29, 2019); eBook (Final Draft, 8/6/2019)
• Permission: Feel free to download (drafts) if you will use it for your personal research and education needs.
• Hardcover: 440 pages
• eBook: PDF
• Language: English
• ISBN-10: 0691189137
• ISBN-13: 978-0691189130
• Share This:  

Book Description

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 has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors.

• Comprehensive coverage of computational complexity theory, and beyond
• High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline
• Historical accounts of the evolution and motivations of central concepts and models
• A broad view of the theory of computation's influence on science, technology, and society
• Extensive bibliography

• N/A

• Amazon

• Computational Complexity
• Theory of Computation and Computing
• Applied Mathematics
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Mathematical Logic - Set Theory, Model Theory, Computability, etc

• Mathematics and Computation: A Theory Revolutionizing Technology and Science
• The Mirror Site (1) - PDF

• 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.

• Complexity Theory: A Modern Approach (Sanjeev Arora, et al)

  This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation.

• 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.