In a previous paper the present authors (Baier and Wagner, 1996) investigated an S-V-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so-called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy
β Scribed by Pascal Koiran
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 240 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0885-064X
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 an infinite-dimensional real Hilbert space, we introduce a class of fourthdegree polynomials which do not satisfy Rolle's Theorem in the unit ball. Extending what happens in the finite-dimensional case, we show that every fourth-degree polynomial defined by a compact operator satisfies Rolle's Th
The generating functional of the lsing model is studied. Equations of motion for the generating functional and the hierarchy of Green's functions are derived. These equations resemble a scalar field theory with nonlinear derivative coupling. Such a formulation bridges the gap between the Ising model