Sciweavers

CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 11 months ago
Circuits with arbitrary gates for random operators
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...
Stasys Jukna, Georg Schnitger
JACM
2002
122views more  JACM 2002»
13 years 11 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
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, ...
Larry J. Stockmeyer, Albert R. Meyer
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 3 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
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...
Rafi Heiman, Avi Wigderson