Omslagsbillede

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

Fuld beskrivelse

Saved in:
Bibliografiske detaljer
Hovedforfatter: Jukna, Stasys. (Author, http://id.loc.gov/vocabulary/relators/aut)
Institution som forfatter: SpringerLink (Online service)
Format: Electronisk eBog
Sprog:English
Udgivet: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Udgivelse:1st ed. 2012.
Serier:Algorithms and Combinatorics, 27
Fag:
Information theory.
Computers.
Combinatorics.
Computer science—Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Mathematics of Computing.
Online adgang:https://doi.org/10.1007/978-3-642-24508-4
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
Indholdsfortegnelse:
  • 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.

Lignende værker