New lower bounds on the formula size of Boolean functions

@article{Schrfeld1983NewLB,
  title={New lower bounds on the formula size of Boolean functions},
  author={Ute Sch{\"u}rfeld},
  journal={Acta Informatica},
  year={1983},
  volume={19},
  pages={183-194}
}
In this paper we investigate the method of Nechiporuk [3] for deriving lower bounds on the formula size of Boolean functions. At first we prove non-linear lower bounds for functions which are related to the existence of a k-clique or a k-circle in a graph. Furthermore we determine the formula size of the “disjoint disjunction” of the outputs of the Boolean… CONTINUE READING