Obálka

Boolean Function Complexity Advances and Frontiers /

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

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: Jukna, Stasys. (Autor, http://id.loc.gov/vocabulary/relators/aut)
Korporativní autor: SpringerLink (Online service)
Médium: Elektronický zdroj E-kniha
Jazyk:English
Vydáno: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Vydání:1st ed. 2012.
Edice:Algorithms and Combinatorics, 27
Témata:
Information theory.
Computers.
Combinatorics.
Computer science—Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Mathematics of Computing.
On-line přístup:https://doi.org/10.1007/978-3-642-24508-4
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
Obsah:
  • 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.

Podobné jednotky