English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Some Remarks on Boolean Sums

Mehlhorn, K. (1979). Some Remarks on Boolean Sums. Acta Informatica, 12, 371-375.

Item is

Files

show Files
hide Files
:
Mehlhorn_a_1979_j.pdf (Any fulltext), 199KB
 
File Permalink:
-
Name:
Mehlhorn_a_1979_j.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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

Details

show
hide
Language(s): eng - English
 Dates: 2007-01-051979
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344675
Other: Local-ID: C1256428004B93B8-E1DE71087E352B48C12571C300168CA5-mehlhorn79j
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Acta Informatica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 12 Sequence Number: - Start / End Page: 371 - 375 Identifier: -