Title of article :
Complexity of Boolean functions over bases with unbounded fan-in gates
Author/Authors :
Vlado Dan ?k، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Keywords :
Boolean functions: Computational complexity
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
