Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2004

2004

We study whether sets inside NP can be reduced to sets with low information content but possibly still high computational… Expand

2002

2002

We study whether one can prune solutions from NP functions. Though it is known that, unless surprising complexity class collapses… Expand

1997

1997

This paper studies, for UP, two topics that have been intensely studied for NP: Boolean hierarchies and the consequences of the… Expand

Highly Cited

1996

Highly Cited

1996

We show that if the Boolean hierarchy collapses to level $k$, then the polynomial hierarchy collapses to $BH_{3}(k)$, where $BH_… Expand

Highly Cited

1991

Highly Cited

1991

We study the complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number… Expand

1991

1991

Abstract We show that probabilistic polynomial time (PP) is closed under polynomial-time parity reductions. As corollaries, we… Expand

Highly Cited

1989

Highly Cited

1989

The Boolean Hierarchy I: Structural Properties [J. Cai et al., SIAM J. Comput ., 17 (1988), pp. 1232–252] explores the structure… Expand

Highly Cited

1988

Highly Cited

1988

It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that ${\text{co-NP}} \subseteq… Expand

Highly Cited

1988

Highly Cited

1988

In this paper, we study the complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets… Expand

Highly Cited

1986

Highly Cited

1986

In this paper, we study the complexity of sets formed by boolean operations (∪, ∩, and complementation) on NP sets. These are the… Expand