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}
}
  • Richard Beigel, Harry Buhrman, Lance Fortnow
  • Published in STOC '98 1997
  • Mathematics, Computer Science
  • 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

    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

    • Richard Ryan Williams
    • Computer Science, Mathematics
    • Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
    • 2007
    VIEW 4 EXCERPTS
    CITES RESULTS
    HIGHLY INFLUENCED

    Quantum Computation Relative to Oracles

    VIEW 6 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Fixed-Polynomial Size Circuit Bounds

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 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
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

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

    • Steven Homer, Alan L. Selman
    • Mathematics, Computer Science
    • [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
    • 1989
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On Isomorphisms and Density of NP and Other Complete Sets

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Hay

    • L S. Buss
    • On truth-table reducibility to SAT Information and Computation ary
    • 1991
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL