Perceptrons, PP, and the polynomial hierarchy
- 1 December 1994
- journal article
- Published by Springer Nature in computational complexity
- Vol. 4 (4) , 339-349
- https://doi.org/10.1007/bf01263422
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The perceptron strikes backPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On ACCcomputational complexity, 1994
- Depth Reduction for Circuits of Unbounded Fan-inInformation and Computation, 1994
- SeparatingPH fromPP by relativizationActa Mathematica Sinica, English Series, 1992
- On truth-table reducibility to SATInformation and Computation, 1991
- Probabilistic polynomial time is closed under parity reductionsInformation Processing Letters, 1991
- The expressive power of voting polynomialsPublished by Association for Computing Machinery (ACM) ,1991
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Linear Approximation.The American Mathematical Monthly, 1966
- Schwankung von Polynomen zwischen GitterpunktenMathematische Zeitschrift, 1964