Title of article

Complexity of Boolean functions over bases with unbounded fan-in gates

Author/Authors

Vlado Dan ?k، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 1996

Pages

4

From page

31

To page

34

Keywords

Boolean functions: Computational complexity

Journal title

Information Processing Letters

Serial Year

1996

Journal title

Information Processing Letters

Record number

128407