O tej e-knjigi
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 avtorju
Ryan O'Donnell is an Associate Professor in the Computer Science Department at Carnegie Mellon University.
Ocenite to e-knjigo
Povejte nam svoje mnenje.
Informacije o branju
Pametni telefoni in tablični računalniki
Namestite aplikacijo Knjige Google Play za Android in iPad/iPhone. Samodejno se sinhronizira z računom in kjer koli omogoča branje s povezavo ali brez nje.
Prenosni in namizni računalniki
Poslušate lahko zvočne knjige, ki ste jih kupili v Googlu Play v brskalniku računalnika.
Bralniki e-knjig in druge naprave
Če želite brati v napravah, ki imajo zaslone z e-črnilom, kot so e-bralniki Kobo, morate prenesti datoteko in jo kopirati v napravo. Podrobna navodila za prenos datotek v podprte bralnike e-knjig najdete v centru za pomoč.
