Hardcover. 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 GoldreichLevin algorithm from cryptography/learning theory, Hastad'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. This graduate-level 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, the GoldreichLevin algorithm, hardness of approximation, and 'sharp threshold' theorems for random graphs. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

N� de ref. del art�culo 9781107038325

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Analysis of Boolean Functions (Hardcover)
Editor: Cambridge University Press, Cambridge
Fecha de publicaci�n: 2014
Idioma: Ingl�s
ISBN 10: 1107038324
ISBN 13: 9781107038325
Encuadernaci�n: Hardcover
Estado: new

Acerca de

Sinopsis

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.

Acerca del autor

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

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

The Nile Group Pty Ltd
42 Apex Drive, Truganina, VIC, 3029, Australia

Condiciones de venta y env�o

Condiciones de venta

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condiciones de env�o

Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.