Some Remarks on Boolean Sums

Mehlhorn, Kurt

doi:10.1007/BF00268321

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Some Remarks on Boolean Sums

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K. (1979). Some Remarks on Boolean Sums. Acta Informatica, 12, 371-375. doi:10.1007/BF00268321.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF87-1

Abstract

Summary Neciporuk, Lamagna/Savage and Tarjan determined the monotone network
complexity of a set of Boolean sums if any two sums have at most one variable
in common. Wegener then solved the case that any two sums have at most k
variables in common. We extend his methods and results and consider the case
that any set of h +1 distinct sums have at most k variables in common. We use
our general results to explicitly construct a set of n Boolean sums over n
variables whose monotone complexity is of order n 5/3. The best previously
known bound was of order n 3/2. Related results were obtained independently by
Pippenger.
This paper was presented at the MFCS 79 Symposium, Olomouc, Sept. 79