Please use this identifier to cite or link to this item: doi:10.22028/D291-26095
Title: A boolean function requiring 3n network size
Author(s): Blum, Norbert
Language: English
Year of Publication: 1982
OPUS Scource: Saarbrücken, 1982
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Paul [P] first proved a 2.5n-lower bound for the network complexity of an explicit boolean function. We modify the definition of Paul's function a little and prove a 3n-lower bound for the network complexity of that function.
Link to this record: urn:nbn:de:bsz:291-scidok-40653
hdl:20.500.11880/26151
http://dx.doi.org/10.22028/D291-26095
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1982/13
Date of registration: 2-Aug-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1982_13ocr.pdf2,33 MBAdobe PDFView/Open


Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.