The discrepancy method: randomness and complexity 论文
2002Choice Reviews Online引用 365
Benford’s Law and Fraud DetectionCellular Automata and ApplicationsComplexity and Algorithms in Graphs
摘要
This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory minimum spanning trees, linear circuit complexity, and multidimensonal searching.
作者
暂无数据
相关事件
暂无数据
相关文章
暂无数据