75 search results - page 1 / 15 » On the Monotone Circuit Complexity of Quadratic Boolean Func... |
159
Voted
ISAAC
2004
Springer
16 years 12 days ago
2004
Springer
189
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
202
click to vote
CIE
2010
Springer
15 years 12 months ago
2010
Springer
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 ...
187
click to vote
IPL
2010
15 years 5 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...