The discrepancy method : Randomness and complexity
The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succi...
Đã lưu trong:
Tác giả chính: | |
---|---|
Định dạng: | Sách |
Ngôn ngữ: | Undetermined |
Được phát hành: |
Cambridge, UK
Cambridge University Press
2000
|
Những chủ đề: | |
Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
---|
LEADER | 01441nam a2200217Ia 4500 | ||
---|---|---|---|
001 | CTU_166459 | ||
008 | 210402s9999 xx 000 0 und d | ||
020 | |c 82.22 | ||
082 | |a 512.7 | ||
082 | |b C513 | ||
100 | |a Chazelle, B. | ||
245 | 4 | |a The discrepancy method : | |
245 | 0 | |b Randomness and complexity | |
245 | 0 | |c Bernard Chazelle | |
260 | |a Cambridge, UK | ||
260 | |b Cambridge University Press | ||
260 | |c 2000 | ||
520 | |a The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites | ||
650 | |a Irregularities of distribution (Number theory),Random variables,Computational complexity,Lý thuyết số,Ngẫu biến,Tính toán ngẫu biến | ||
904 | |i Qhieu | ||
980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ |