Title of article :
A lower bound for depth-3 circuits with MOD m gates
Author/Authors :
Vince Grolmusz، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Keywords :
Complexity of finite functions , Composite moduli:Computational complexity , Circuit complexity , Communication complexity , randomized algorithms
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
