Combinational Complexity of Some Monotone Functions

@inproceedings{Lamagna1974CombinationalCO,
title={Combinational Complexity of Some Monotone Functions},
author={Edmund A. Lamagna and John E. Savage},
booktitle={SWAT},
year={1974}
}

Edmund A. Lamagna and John E. Savaget Brown University Providence. RI 02912 An important open question in the field of computational complexity in the development of non trivial lower bounds on the number of logical opera tions required to compute switching functions. Although counting arguments can be used to show that most Boolean functions of n inputs and O(n) or fewer outputs have complexity growing exponentially in n, no one has yet exhibited a particular such function whose unlimited… CONTINUE READING