Some Remarks on Boolean Sums

Mehlhorn, Kurt

doi:10.1007/BF00268321

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Some Remarks on Boolean Sums

MPS-Authors

/persons/resource/persons45021

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

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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

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

要旨

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