Our Adversary: The Circuit

Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

Abstract

Boolean (or switching) functions map each sequence of bits to a single bit 0 or 1. Bit 0 is usually interpreted as “false”, and bit 1 as “true”. The simplest of such functions are the product\(\rm{x\cdot y}\), sum\(\rm{x\oplus y}\) mod 2, non-exclusive Or \({x\vee y}\), negation \(\neg x=1-x\) The central problem of boolean function complexity—the lower bounds problem—is:

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations