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

Kazuo Iwama; Hiroki Morizumi

Conference Proceedings

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

Iwama K
Morizumi H

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2420 353-364

DOI: 10.1007/3-540-45687-2_29

61Citations

26Readers

Get full text

Abstract

The current best lower bound of 4.5n − o(n) for an explicit family of Boolean circuits [3] is improved to 5n − o(n) using the same family of Boolean function.

Cite

CITATION STYLE

APA

Iwama, K., & Morizumi, H. (2002). An explicit lower bound of 5n − o(n) for boolean circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2420, pp. 353–364). Springer Verlag. https://doi.org/10.1007/3-540-45687-2_29

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

Abstract

Cite

Register to see more suggestions