Sparse Oracles And Uniform Complexity Classes ; Article #: ; Date of Conference: 24-26 October 1984 ; Date Added to IEEE Xplore: 10 December 2002.

We show that several questions about the polynomial-time hierarchy can be answered by answer- ing their counterparts for the polynomial-time hierarchy ...

Complexity classes are usually defined by referring to computation models and by putting suitable restrictions on them.

Abstract. We show that several questions about the polynomial-time hierarchy can be answered by answering their counterparts for the polynomial-time ...

The results of this paper differ in that we assume no changes in the behavior of oracle machines; rather, we restrict the class of oracle sets to either sparse ...

This article clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems ...

A Uniform Approach to Define Complexity Classes · On the power of number-theoretic operations with respect to counting · Complexity Classes with Finite Acceptance ...

We show that the polynomial hierarchy collapses if and only if there is a sparse set S such that the polynomial hierarchy relative to S collapses.

The theorem states that the P = NP question crucially depends on the complexity of the organization of S, a non-uniform property. We proved our theorem in a ...

Long and Selman (1986) proved that, for most familiar pairs of complexity classes, separating the classes with a tally oracle is no easier than truly ...