ON ACC and threshold circuits

It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circui...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 619 - 627 vol.2
Main Author Yao, A.C.-C.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Character recognition
Circuit theory
Computer science
Frequency selective surfaces
Galois fields
Input variables
Polynomials
Upper bound
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89583

Cover

More Information
Summary:It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of that size. This result gives the first nontrivial upper bound on the computing power of ACC circuits.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89583