A relationship between difference hierarchies and relativized polynomial hierarchies
β Scribed by Richard Beigel; Richard Chang; Mitsunori Ogiwara
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 900 KB
- Volume
- 26
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We show that the bounded arithmetic theory V^0^ does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some au
In this work, we establish the relations between neural networks and hierarchies of quasiarithmetic means. We show that a neural network with the same activation function in all the neurons gives an output that is isomorphic to the result that can be obtained with a hierarchy of quasiarithmetic mean