|
|
|
|
LEADER |
01897cam a2200469 4500 |
001 |
PPN053171446 |
003 |
http://www.sudoc.fr/053171446 |
005 |
20190627110200.0 |
010 |
|
|
|a 0-521-77093-9
|b rel.
|d 105.27 EUR
|
010 |
|
|
|a 0-521-00357-1
|b br.
|
010 |
|
|
|a 978-0-521-77093-4
|b rel.
|
010 |
|
|
|a 978-0-521-00357-5
|b br.
|
035 |
|
|
|a (OCoLC)491393666
|
035 |
|
|
|a ocm42861716
|
073 |
|
1 |
|a 9780521770934
|
100 |
|
|
|a 19991109h20002000k y0frey0103 ba
|
101 |
0 |
|
|a eng
|
102 |
|
|
|a GB
|a US
|
105 |
|
|
|a a a 001yy
|
106 |
|
|
|a r
|
200 |
1 |
|
|a The discrepancy method
|b Texte imprimé
|e randomness and complexity
|f Bernard Chazelle
|
210 |
|
|
|a Cambridge
|a New York
|c Cambridge University Press
|d cop. 2000
|
215 |
|
|
|a 1 vol. (XVII-475 p.)
|c ill., couv. ill. en coul.
|d 23 cm
|
305 |
|
|
|a Autre tirage : 2001
|
320 |
|
|
|a Bibliogr. p. 454-468. Index
|
359 |
2 |
|
|b 1, Combinatorial discrepancy
|b 2, Upper bound techniques
|b 3, Lower bound techniques
|b 4, Sampling
|b 5, Geometric searching
|b 6, Complexity lower bounds
|b 7, Convex hulls and voronoi diagrams
|b 8, Linear programming and extensions
|b 9, Pseudorandomness
|b 10, Communication complexity
|b 11, Minimum spanning trees
|
606 |
|
|
|3 PPN029807905
|a Variables aléatoires
|2 rameau
|
606 |
|
|
|3 PPN027282171
|a Algorithmes
|2 rameau
|
606 |
|
|
|3 PPN027551261
|a Complexité de calcul (informatique)
|2 rameau
|
606 |
|
|
|3 PPN027241289
|a Probabilités
|2 rameau
|
676 |
|
|
|a 511.8
|
686 |
|
|
|a G.3
|2 acm
|
700 |
|
1 |
|3 PPN074180622
|a Chazelle
|b Bernard
|f 1955-....
|4 070
|
801 |
|
1 |
|a US
|b OCLC
|g AACR2
|
801 |
|
2 |
|a FR
|b AUROC
|g AFNOR
|
801 |
|
3 |
|a FR
|b Abes
|c 20160824
|g AFNOR
|
915 |
|
|
|5 441092208:639550282
|b 17786
|
930 |
|
|
|5 441092208:639550282
|b 441092208
|a 65C358
|j u
|
979 |
|
|
|a CCFA
|
991 |
|
|
|5 441092208:639550282
|a exemplaire créé automatiquement par l'ABES
|
997 |
|
|
|a CCFA
|b 17786
|d CMB
|e BAP
|s d
|c 65C358
|
998 |
|
|
|a 846300
|