O ovoj e-knjizi
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.
O autoru
Ryan O'Donnell is an Associate Professor in the Computer Science Department at Carnegie Mellon University.
Ocijenite ovu e-knjigu
Recite nam što mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinkronizira s vašim računom i omogućuje vam da čitate online ili offline gdje god bili.
Prijenosna i stolna računala
Audioknjige kupljene na Google Playu možete slušati pomoću web-preglednika na računalu.
Elektronički čitači i ostali uređaji
Za čitanje na uređajima s elektroničkom tintom, kao što su Kobo e-čitači, trebate preuzeti datoteku i prenijeti je na svoj uređaj. Slijedite detaljne upute u centru za pomoć za prijenos datoteka na podržane e-čitače.
