Relativized polynomial time hierarchies having exactly K levels · Contents. STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing.

It is proved that for every integer k ≧ 0 , there is an oracle A k relative to which the polynomial time hierarchy collapses so that it has exactly k levels ...

Abstract: Summary form only given. The relativization of the Meyer-Stockmeyer polynomial-time hierarchy is treated. The proof techniques combine an encoding ...

This paper concerns the relativization of the Meyer-Stockmeyer polynomial-time hierarchy. (PH). Recently, through the work of Furst, Saxe and Sipser [1984], ...

The following lemma is a stronger form of this result. It states that no depth-k circuit with small bottom fanin can compute any of an exponential number of fin ...

The relativization of the Meyer-Stockmeyer polynomial-time hierarchy is treated. The proof techniques combine an encoding scheme with probabilistic arguments.

It is proved that for every integer k => 0, there is an oracle Ak relative to which the polynomial time hierarchy collapses so that it has exactly k levels.

It is shown that there are functions computable by linear size boolean circuits of depth k that require superpolynomial size perceptrons of depthk?1 to be ...

It is proved that for every integer $k \geqq 0$, there is an oracle $A_k $ relative to which the polynomial time hierarchy collapses so that it has exactly ...

Bibliographic details on Relativized polynomial time hierarchies having exactly K levels.