Omslagsbild

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

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: Jukna, Stasys. (Författare, medförfattare, http://id.loc.gov/vocabulary/relators/aut)
Institutionell upphovsman: SpringerLink (Online service)
Materialtyp: Elektronisk E-bok
Språk:English
Publicerad: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Upplaga:1st ed. 2012.
Serie:Algorithms and Combinatorics, 27
Ämnen:
Information theory.
Computers.
Combinatorics.
Computer science—Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Mathematics of Computing.
Länkar:https://doi.org/10.1007/978-3-642-24508-4
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!
Innehållsförteckning:
  • 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.

Liknande verk