Combinational Complexity of Some Monotone Functions

  title={Combinational Complexity of Some Monotone Functions},
  author={Edmund A. Lamagna and John E. Savage},
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
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 12 extracted citations


Publications referenced by this paper.
Showing 1-3 of 3 references

Toward a Lower Bound for Sorting Networks

Complexity of Computer Computations • 1972

A Generalization of a Divide-Sort-Merge Strategy for Sortinr Net­ works

Van Voorhis, C D.
Technical Report No . 16, • 1971

On a Boolean Matrix

Necipouik, I E.
Systems Research Theory, Vol • 1971

Similar Papers

Loading similar papers…