{ "item_title" : "The Discrepancy Method", "item_author" : [" Bernard Chazelle "], "item_description" : "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. More information can be found on the book's home page at http: //www.cs.princeton.edu/ chazelle/book.html.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/52/100/357/0521003571_b.jpg", "price_data" : { "retail_price" : "78.00", "online_price" : "78.00", "our_price" : "78.00", "club_price" : "78.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details