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...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile nagusia: Chazelle, B.
Formatua: Liburua
Hizkuntza:Undetermined
Argitaratua: Cambridge, UK Cambridge University Press 2000
Gaiak:
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
Thư viện lưu trữ: Trung tâm Học liệu Trường Đại học Cần Thơ
Deskribapena
Gaia: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