Azala

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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile nagusia: Jukna, Stasys. (Egilea, http://id.loc.gov/vocabulary/relators/aut)
Erakunde egilea: SpringerLink (Online service)
Formatua: Baliabide elektronikoa eBook
Hizkuntza:English
Argitaratua: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edizioa:1st ed. 2012.
Saila:Algorithms and Combinatorics, 27
Gaiak:
Information theory.
Computers.
Combinatorics.
Computer science—Mathematics.
Information and Communication, Circuits.
Theory of Computation.
Mathematics of Computing.
Sarrera elektronikoa:https://doi.org/10.1007/978-3-642-24508-4
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
Aurkibidea:
  • 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.

Antzeko izenburuak