MARC record from Internet Archive

LEADER: 02192cam 22004574a 4500
001 9920018150001661
005 20150423124008.0
008 071004s2008 njua b 001 0 eng
010 $a 2007041609
015 $aGBA817707$2bnb
016 7 $a014519398$2Uk
020 $a9780470170205 (cloth : acid-free paper)
020 $a0470170204 (cloth : acid-free paper)
035 $a(CSdNU)u332696-01national_inst
035 $a(OCoLC)173809124
035 $a(OCoLC)173809124
035 $a(OCoLC)173809124
040 $aDLC$cDLC$dBTCTA$dBAKER$dUKM$dYDXCP$dC#P$dBWX$dCDX$dOrLoB-B
049 $aCNUM
050 00 $aQA164$b.A46 2008
082 00 $a511/.6$222
100 1 $aAlon, Noga.
245 14 $aThe probabilistic method /$cNoga Alon, Joel H. Spencer.
250 $a3rd ed.
260 $aHoboken, N.J. :$bWiley,$cc2008.
300 $axv, 352 p. :$bill. ;$c25 cm.
440 0 $aWiley-Interscience series in discrete mathematics and optimization
504 $aIncludes bibliographical references (p. 331-344) and indexes.
505 0 $aPt. I. Methods -- 1. The basic method -- 2. Linearity of expectation -- 3. Alterations -- 4. The second moment -- 5. The local lemma -- 6. Correlation inequalities -- 7. Martingales and tight concentration -- 8. The Poisson paradigm -- 9. Pseudorandomness -- 10. Random graphs -- 11. The Erdos-Renyi phase transition -- 12. Circuit complexity -- 13. Discrepancy -- 14. Geometry -- 15. Codes, games and entropy -- 16. Derandomization -- 17. Graph property testing -- App. A. Bounding of large deviations -- App. B. Paul Erdos.
650 0 $aCombinatorial analysis.
650 0 $aProbabilities.
700 1 $aSpencer, Joel H.
938 $aBaker & Taylor$bBKTY$c110.00$d110.00$i0470170204$n0007508014$sactive
938 $aYBP Library Services$bYANK$n2786921
938 $aBaker and Taylor$bBTCP$n2007041609
938 $aBlackwell Book Service$bBBUS$nR6728069$c$110.00
938 $aCoutts Information Services$bCOUT$n6353089
947 $fCOLS-MTH$hCIRCSTACKS$p$94.60$q1
949 $aQA 164 .A46 2008$i31786102437438
994 $a92$bCNU
999 $aQA 164 .A46 2008$wLC$c1$i31786102437438$lCIRCSTACKS$mNULS$rY$sY$tBOOK $u9/22/2008