NP Might Not Be As Easy As Detecting Unique Solutions

@inproceedings{Beigel1997NPMN,
  title={NP Might Not Be As Easy As Detecting Unique Solutions},
  author={Richard Beigel and Harry Buhrman and Lance Fortnow},
  booktitle={STOC},
  year={1997}
}
We construct an oracle A such that PA = PA andNPA = EXPA: This relativized world has several amazing properties: The oracleA gives the first relativized world where one can solve satisfiability on formulae with at most one assignment yet P 6= NP. The oracleA is the first where PA = UPA 6= NPA = coNPA: The construction gives a much simpler proof than that of Fenner, Fortnow and Kurtz of a relativized world where all theNP-complete sets are polynomial-time isomorphic. It is the first such… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A note on many-one and 1-truth table complete sets

  • S. Homer, S. Kurtz, J. Royer
  • Science, 115(2):383–389, July
  • 1993
Highly Influential
7 Excerpts

Hay

  • L S. Buss
  • On truth-table reducibility to SAT Information…
  • 1991
Highly Influential
3 Excerpts