Abstract
We prove that every set in uniform-AC0 can be recognized by a uniform family of depth-three threshold circuits of size \(n^{log^{O(1)} n}\).
Supported in part by National Science Foundation Grants CCR-8810467 and CCR-9000045. Some of this research was performed while the author was a visiting professor at Institut für Informatik, Universität Würzburg, D-8700 Würzburg, Federal Republic of Germany
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Symposium on Foundations of Computer Science, pp. 75–83.
E. Allender, A note on the power of threshold circuits, Proc. 30th IEEE Symposium on Foundations of Computer Science, pp. 580–584.
E. Allender, P-uniform circuit complexity, J. ACM 36, 912–928.
D. A. Mix Barrington, N. Immerman, and H. Straubing, On uniformity within NC 1, Proc. 3rd IEEE Structure in Complexity Theory Conference, pp. 47–59.
J. Bruck and C. Smolensky, Polynomial threshold functions, AC 0 functions, and spectral norms, Tech. Report RJ 7140 (67387) IBM, Yorktown Heights.
A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 99–110.
J. Håstad, Computational limitations for small-depth circuits, Doctoral Dissertation, MIT.
C. Lautemann, BPP and the polynomial hierarchy, Information Processing Letters 17, 215–217.
N. Nisan and A. Wigderson, Hardness vs. randomness, Proc. 29th IEEE Symposium on Foundations of Computer Science, pp. 2–11.
I. Parberry and G. Schnitger, Parallel computation with threshold functions, J. Computer and System Science 36, 278–302.
A. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mathematicheskie Zametki 41(4), 598–607. English translation in Mathematical Notes of the Academy of Sciences of the USSR 41:4, 333–338.
W. Ruzzo, On Uniform Circuit Complexity, J. Comput. and System Sci. 21, 365–383.
M. Sipser, A complexity theoretic approach to randomness, Proc. 15th Annual ACM Symposium on Theory of Computing, pp. 330–335.
R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proc. 19th ACM Symposium on Theory of Computing, pp. 77–82.
L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 85–93.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E., Hertrampf, U. (1990). On the power of uniform families of constant depth threshold circuits. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029603
Download citation
DOI: https://doi.org/10.1007/BFb0029603
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive