How NP got a new definition: a survey of probabilistically checkable proofs

Details How NP got a new definition: a survey of probabilistically checkable proofs How NP got a new definition: a survey of probabilistically checkable proofs

2003-04-28

arxiv.org/abs/cs/0304038v1

Proceedings of the ICM, Beijing 2002, vol. 3, 637--648

Computer Science

Computational Complexity

Scientific paper

We survey a collective achievement of a group of researchers: the PCP
Theorems. They give new definitions of the class \np, and imply that computing
approximate solutions to many \np-hard problems is itself \np-hard. Techniques
developed to prove them have had many other consequences.

Affiliated with

Also associated with

No associations

Rating

How NP got a new definition: a survey of probabilistically checkable proofs 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 How NP got a new definition: a survey of probabilistically checkable proofs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How NP got a new definition: a survey of probabilistically checkable proofs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333832