Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CIE
2010
Springer

favoriteEmaildiscussreport

214views Applied Computing» more CIE 2010»

Circuit Complexity and Multiplicative Complexity of Boolean Functions

13 years 9 months ago

Circuit Complexity and Multiplicative Complexity of Boolean Functions

Download logic.pdmi.ras.ru

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 diﬀerent weights to XOR and AND gates.

Arist Kojevnikov, Alexander S. Kulikov

Real-time Traffic

Applied Computing | Boolean Circuit Complexity | CIE 2010 | Circuit Complexity | Lower Bound |

claim paper

Related Content

» New upper bounds on the Boolean circuit complexity of symmetric functions

» Energy Complexity and Depth of Threshold Circuits

» On the Monotone Circuit Complexity of Quadratic Boolean Functions

» The Complexity of Depth3 Circuits Computing Symmetric Boolean Functions

» Communication Complexity Towards Lower Bounds on Circuit Depth

» Limiting Negations in Formulas

» Structural Detection of Symmetries in Boolean Functions

» Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates

» The complexity of Boolean functions from cryptographic viewpoint

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	CIE
Authors	Arist Kojevnikov, Alexander S. Kulikov

Comments (0)