A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy

Journal of Computer and System Sciences

Volumn 56, Issue 3, 1998, Pages 263-271

  Berg, Christer ^a   Ulfberg, Staffan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; NEURAL NETWORKS; POLYNOMIALS;

ORACLE SEPARATION; SUPERPOLYNOMIALS;

HIERARCHICAL SYSTEMS;

EID: 0032090473     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1552     Document Type: Article

References (14)

1. R. Beigel, Perceptions, PP, and the polynomial hierarchy, Comput. Complexity 4, No. 4 (1994), 339-349.
2. R. Beigel, L. A. Hemachandra, and G. Wechsung, Probabilistic polynomial time is closed under parity reductions, Inform. Process. Lett. 37 (1991), 91-94.
3. R. Beigel, N. Reingold, and D. Spielman, PP is closed under intersection, J. Comput. System Sci. 50, No. 2 (1995), 191-202.
4. B. Fu, Separating PH from PP by relativization, Acta Math. Sinica (New Ser.) 8, No. 3 (1992), 329-336.
5. M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17 (1984), 13-27.
6. PH, Inform. Process. Lett. 37 (1991), 149-153.
7. F. Green, A lower bound for monotone perceptrons, Math. Systems Theory 28 (1995), 283-298.
8. J. Håstad, "Computational Limitations for Small-Depth Circuits," ACM doctoral disseratation awards, MIT Press, Cambridge, MA, 1987.
9. J. Håstad, Almost optimal lower bounds for small depth circuits, in "Randomness and Computation" (S. Micali, Ed.), Advances in Computing Research, Vol. 5, pp. 143-170, JAI Press, London, 1989.
10. J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, Comput. Complexity 1, No. 2 (1991), 113-129.
11. K. Ko, Relativized polynomial time hierarchies having exactly k levels, SIAM J. Comput. 18, No. 2 (1989), 392-408.
12. M. Minsky and S. Papert, "Perceptrons," MIT Press, Cambridge, MA, 1988. [expanded edition]
13. M. Sipser, Borel sets and circuit complexity, in "Proceedings of 15th Annual ACM Symposium on Theory of Computing, 1983," pp. 61-69.
14. A. Yao, Separating the polynomial-time hierarchy by oracles, in "Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985," pp. 1-10.