Da
BooksRun, Philadelphia, PA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 2 febbraio 2016
The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped. Codice articolo 1107038324-10-1
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.
Informazioni sull?autore: Ryan O'Donnell is an Associate Professor in the Computer Science Department at Carnegie Mellon University.
Titolo: Analysis of Boolean Functions
Casa editrice: Cambridge University Press (edition 1)
Data di pubblicazione: 2014
Legatura: Hardcover
Condizione: New
Edizione: 1.
Da: Buchkanzlei, Bremen, Germania
Hardcover. Condizione: Sehr gut. 444 pp. very well-preserved copy 367 Sprache: Englisch Gewicht in Gramm: 754. Codice articolo 39867
Quantità: 1 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 20411391-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781107038325_new
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 20411391-n
Quantità: Più di 20 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 444. Codice articolo 1897806922
Quantità: 4 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 424 pages. 8.75x6.00x1.00 inches. In Stock. This item is printed on demand. Codice articolo __1107038324
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 444 13 Illus. Codice articolo 94623135
Quantità: 4 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107038325
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781107038325
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 444. Codice articolo 2697806912
Quantità: 1 disponibili