rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: The
    title: discrepancy method
  title info:
    sub title: Randomness and complexity
  title info: title
  name:
    name part: Chazelle, B.
    role:
      role term: creator
  type of resource: text
  origin info:
    place:
      place term: xx
    place:
      place term: Cambridge, UK
    publisher: Cambridge University Press
    date issued: 2000
    date issued: 9999
    issuance: monographic
  language:
    language term: und
  physical description:
    form: print
  abstract: 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
  note: Bernard Chazelle
  subject:
    topic: Irregularities of distribution (Number theory),Random variables,Computational complexity,Lý thuyết số,Ngẫu biến,Tính toán ngẫu biến
  classification: 512.7
  classification: C513
  record info:
    record creation date: 210402
    record identifier: CTU_166459