A new lower bound on the monotone network complexity of Boolean sums.
Saved in:
| Title: | A new lower bound on the monotone network complexity of Boolean sums. |
|---|---|
| Authors: | Wegener, Ingo1 |
| Source: | Acta Informatica. 1980, Vol. 13 Issue 2, p109-114. 6p. |
| Database: | Mathematics Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 73361165 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A new lower bound on the monotone network complexity of Boolean sums. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Wegener%2C+Ingo%22">Wegener, Ingo</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Acta+Informatica%22">Acta Informatica</searchLink>. 1980, Vol. 13 Issue 2, p109-114. 6p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=73361165 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/BF00263988 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 6 StartPage: 109 Titles: – TitleFull: A new lower bound on the monotone network complexity of Boolean sums. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Wegener, Ingo IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: 1980 Type: published Y: 1980 Identifiers: – Type: issn-print Value: 00015903 Numbering: – Type: volume Value: 13 – Type: issue Value: 2 Titles: – TitleFull: Acta Informatica Type: main |
| ResultId | 1 |