Price loading...

Cambridge University Press Analysis of Boolean Functions

Name: Analysis of Boolean Functions
Brand: Cambridge University Press

Architecture & Microprocessors

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. 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. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich–Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mathematical fields.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 1107038324
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 05 June 2014
Listed Since: 13 November 2013

Barcode

No barcode data available

Cambridge University Press Analysis of Boolean Functions

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Boolean Functions for Cryptography and Coding Theory

Boolean Functions: With Engineering Applications and Computer Programs

Boolean Functions and Their Applications in Cryptography: 0 (Advances in Computer Science and Technology)

Boolean Models and Methods in Mathematics, Computer Science, and Engineering: 134 (Encyclopedia of Mathematics and its Applications, Series Number 134)

Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27)

Boolean Functions: Theory, Fundamentals & Engineering Applications (Mathematics Research Developments)

Computational Complexity: A Modern Approach

Analytic Combinatorics

Boolean Functions in Coding Theory and Cryptography - AMS Book

Computational Complexity: A Conceptual Perspective

A Handbook of Fourier Theorems

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Set Theory And Its Applications In Physics And Computing

Algorithms For Analysis, Inference, And Control Of Boolean Networks

LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series, Series Number 169)

Language Computability and Formal Language Theory

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Mathematical Foundations of Computer Science

Advanced Boolean Techniques: Selected Papers from the 13th International Workshop on Boolean Problems

Boolean Functions: Topics in Asynchronicity

Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis: 270 (The Springer International Series in Engineering and Computer Science, 270)

Information Theory, Inference and Learning Algorithms

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)