A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function

Alexander S. Kulikov; Olga Melanich; Ivan Mihajlin

Conference Proceedings

A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function

Kulikov A
Melanich O
Mihajlin I

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7318 LNCS 432-439

DOI: 10.1007/978-3-642-30870-3_44

3Citations

5Readers

Get full text

Abstract

We give a simple proof of a 5n - o(n) lower bound on the circuit size over U 2 of a linear function f(x) = Ax where A ε {0,1} log n x n (here, U 2 is the set of all Boolean binary functions except for parity and its complement). © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Kulikov, A. S., Melanich, O., & Mihajlin, I. (2012). A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 432–439). https://doi.org/10.1007/978-3-642-30870-3_44

A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function

Abstract

Cite

Register to see more suggestions