An explicit lower bound of 5n − o(n) for boolean circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 353-364

  Iwama, Kazuo ^a   Morizumi, Hiroki ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC CIRCUITS; TIMING CIRCUITS;

BOOLEAN CIRCUIT; LOWER BOUNDS;

BOOLEAN FUNCTIONS;

EID: 84957018834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_29     Document Type: Conference Paper

References (8)

1. N. Blum. A 2.75n-lower bound on the network complexity of boolean functions. Tech. Rept. A 81/05, Universität des Saarlandes, 1981.
2. N. Blum. A Boolean function requiring 3n network size. Theoret. Comput. Sci., 28, pp. 337-345, 1984.
3. O. Lachish and R. Raz. Explicit lower bound of 4.5n − o(n) for Boolean circuits. Proc. STOC’01, pp. 399-408, 2001.
4. W. Paul. A 2.5n-lower bound on the combinational complexity of boolean functions. SIAM J. Comput. 6, pp. 427-443, 1977.
5. C. Schnorr. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13, pp. 155-171, 1974.
6. L. Stockmeyer. On the combinational complexity of certain symmetric Boolean functions. Math. System Theory 10, pp. 323-336, 1977.
7. I. Wegener. Branching programs and binary decision diagrams. SIAM Monographs on Discrete Mathematics and Applications, 1999.
8. U. Zwick. A 4n lower bound on the combinatorial complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions. SIAM J. Comput. 20, pp. 499-505, 1991.