Om denne e-boken
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.
Om forfatteren
Ryan O'Donnell is an Associate Professor in the Computer Science Department at Carnegie Mellon University.
Vurder denne e-boken
Fortell oss hva du mener.
Hvordan lese innhold
Smarttelefoner og nettbrett
Installer Google Play Bøker-appen for Android og iPad/iPhone. Den synkroniseres automatisk med kontoen din og lar deg lese både med og uten nett – uansett hvor du er.
Datamaskiner
Du kan lytte til lydbøker du har kjøpt på Google Play, i nettleseren på datamaskinen din.
Lesebrett og andre enheter
For å lese på lesebrett som Kobo eReader må du laste ned en fil og overføre den til enheten din. Følg den detaljerte veiledningen i brukerstøtten for å overføre filene til støttede lesebrett.
