• Title: Analysis of Boolean Functions
• Author(s) Ryan O’Donnell
• Publisher: Cambridge University Press (2014); eBook (arXiv Edition, 2021. Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Hardcover: 444 pages
• eBook: PDF (419 pages)
• Language: English
• ISBN-10: 1107038324
• ISBN-13: 978-1107038325
• Share This:  

Book Description

The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry.

• Ryan O'Donnell is a Professor in the Computer Science Department at Carnegie Mellon University.

• Amazon

• Computational Complexity
• Introduction to Computer Science
• Algorithms and Data Structures
• Mathematical Logic - Set Theory, Model Theory, Computability, etc

• Analysis of Boolean Functions (Ryan O’Donnell)
• The Mirror Site (1) - PDF

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

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

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