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:
    title: Boolean Function Complexity
    sub title: Advances and Frontiers
  name:
    name part: Jukna, Stasys.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2012
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVI, 620 p. online resource.
  abstract: Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
  table of contents: Part I Basics -- Part II Communication Complexity -- Part III Circuit Complexity -- Part IV Bounded Depth Circuits -- Part V Branching Programs -- Part VI Fragments of Proof Complexity -- A Epilog -- B Mathematical Background -- References -- Index.
  note: by Stasys Jukna.
  subject:
    topic: Mathematics
  subject:
    topic: Computers
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Information theory
  subject:
    topic: Combinatorics
  subject:
    topic: Mathematics
  subject:
    topic: Information and Communication, Circuits
  subject:
    topic: Theory of Computation
  subject:
    topic: Combinatorics
  subject:
    topic: Mathematics of Computing
  classification: Q350-390
  classification: QA10.4
  classification: 519
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Algorithms and Combinatorics, 27
  identifier: 9783642245084
  identifier: http://dx.doi.org/10.1007/978-3-642-24508-4
  record info:
    record creation date: 120104
    record change date: 20170124141428.0
    record identifier: 978-3-642-24508-4