Abstract
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3-c lower bound on the circuit complexity of a large class of functions representable by high degree polynomials over GF(2). The key idea of the proof is a circuit complexity measure assigning different weights to XOR and AND gates. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kojevnikov, A., & Kulikov, A. S. (2010). Circuit complexity and multiplicative complexity of Boolean functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6158 LNCS, pp. 239–245). https://doi.org/10.1007/978-3-642-13962-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
