Raising NP Lower Bounds to Parallel NP Lower Bounds

Details Raising NP Lower Bounds to Parallel NP Lower Bounds Raising NP Lower Bounds to Parallel NP Lower Bounds

1999-07-25

arxiv.org/abs/cs/9907039v1

SIGACT News vol. 28, no. 2, pp. 2--13, 1997

Computer Science

Computational Complexity

14 pages

Scientific paper

A decade ago, a beautiful paper by Wagner developed a ``toolkit'' that in certain cases allows one to prove problems hard for parallel access to NP. However, the problems his toolkit applies to most directly are not overly natural. During the past year, problems that previously were known only to be NP-hard or coNP-hard have been shown to be hard even for the class of sets solvable via parallel access to NP. Many of these problems are longstanding and extremely natural, such as the Minimum Equivalent Expression problem (which was the original motivation for creating the polynomial hierarchy), the problem of determining the winner in the election system introduced by Lewis Carroll in 1876, and the problem of determining on which inputs heuristic algorithms perform well. In the present article, we survey this recent progress in raising lower bounds.

Affiliated with

Also associated with

No associations

Rating

Raising NP Lower Bounds to Parallel NP Lower Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Raising NP Lower Bounds to Parallel NP Lower Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Raising NP Lower Bounds to Parallel NP Lower Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619311