CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
JACM
2002
13 years 4 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
COCO
1991
Springer
13 years 8 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...