| 000 | cam a | |
| 001 | 2210080787854 | |
| 005 | 20150331101234 | |
| 007 | ta | |
| 008 | 150331s2014 nyu b 001 0 eng d | |
| 010 | ▼a2013050033 | |
| 020 | ▼a9781107038325 (hardback : acid-free paper) | |
| 020 | ▼a9781107471542 (paperback) | |
| 035 | ▼a(KERIS)BIB000013577728 | |
| 040 | ▼aDLC▼beng▼erda▼cDLC▼dDLC▼d211046▼d221008 | |
| 042 | ▼apcc | |
| 082 | ▼a004.0151▼222 | |
| 100 | ▼aO'Donnell, Ryan,▼d1979- | |
| 245 | 00 | ▼aAnalysis of boolean functions /▼cRyan O'Donnell. |
| 260 | ▼aNew York, NY :▼bCambridge University Press,▼c2014. | |
| 300 | ▼axx, 423 p. ;▼c23 cm. | |
| 336 | ▼atext▼2rdacontent | |
| 337 | ▼aunmediated▼2rdamedia | |
| 338 | ▼avolume▼2rdacarrier | |
| 504 | ▼aIncludes bibliographical references and index. | |
| 520 | ▼a"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, 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"--▼cProvided by publisher. | |
| 650 | ▼aComputer science▼xMathematics. | |
| 650 | ▼aAlgebra, Boolean. | |
| 650 | ▼aCOMPUTERS / General.▼2bisacsh | |
| 950 | 0 | ▼bUSD70.00 |
Analysis of boolean functions
Material type
단행본 서양서
Title
Analysis of boolean functions
Author's Name
Publication
New York, NY : Cambridge University Press 2014.
Physical Description
xx, 423 p ; 23 cm.
Keyword
Includes bibliographical references and index. / "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, 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"
Holdings Information
Call no. : 004.0151 O101A
RReservation
MMissing Book Request
CClosed Stack Request
IInter-Campus Loan
CPriority Cataloging
PPrint
| Registration no. | Call no. | Location Mark | Location | Status | Due for return | Service |
|---|---|---|---|---|---|---|
|
Registration no.
W0111520
|
Call no.
004.0151 O101A
|
Location Mark
|
Location
제2자료실(한림도서관5층)
|
Status
대출가능
|
Due for return
|
Service
|