Typical rounding problems
暂无分享,去创建一个
[1] Anand Srivastav,et al. Multicolour Discrepancies , 2003, Comb. Probab. Comput..
[2] Jirí Matousek,et al. Tight upper bounds for the discrepancy of half-spaces , 1995, Discret. Comput. Geom..
[3] J. Spencer. Six standard deviations suffice , 1985 .
[4] Fan Chung Graham,et al. Guessing secrets with inner product questions , 2002, SODA '02.
[5] Anand Srivastav,et al. Recursive Randomized Coloring Beats Fair Dice Random Colorings , 2001, STACS.
[6] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[7] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[8] Benjamin Doerr,et al. Lattice approximation and linear discrepency of totally unimodular matrices , 2001, SODA '01.
[9] Bernard Chazelle,et al. The Discrepancy Method , 1998, ISAAC.
[10] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[11] R. Graham,et al. Handbook of Combinatorics , 1995 .
[12] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[13] Joel H. Spencer,et al. Integral approximation sequences , 1984, Math. Program..
[14] J. Beck,et al. Discrepancy Theory , 1996 .
[15] Noga Alon,et al. Guessing secrets efficiently via list decoding , 2002, SODA '02.
[16] László Lovász,et al. Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..
[17] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..
[18] Joel H. Spencer,et al. Randomization, Derandomization and Antirandomization: Three Games , 1994, Theor. Comput. Sci..
[19] Benjamin Doerr. Linear And Hereditary Discrepancy , 2000, Comb. Probab. Comput..
[20] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1993, Comb..