# 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 '98}, year={1997} }

We construct an oracle A such that PA = PA and NPA = EXPA: This relativized world has several amazing properties: The oracle A gives the first relativized world where one can solve satisfiability on formulae with at most one assignment yet P 6= NP. The oracle A 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 the NP-complete sets are polynomial-time isomorphic. It is the first such… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 23 CITATIONS

## Affine Relativization: Unifying the Algebrization and Relativization Barriers

VIEW 24 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

VIEW 4 EXCERPTS

CITES RESULTS

HIGHLY INFLUENCED

## Quantum Computation Relative to Oracles

VIEW 6 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Solutions Good , m-1 Solutions Better

VIEW 2 EXCERPTS

CITES BACKGROUND

## m Solutions Good, m-1 Solutions Better

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-4 OF 4 REFERENCES

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

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Oracles for structural properties: the isomorphism problem and public-key cryptography

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## On Isomorphisms and Density of NP and Other Complete Sets

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Hay

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL