An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time

Authors:
Richard Zippel
Affiliations:
-
Venue:
An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time
Year:
1989

Citing 0
Cited 1

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inthis note, we demonstrate that a certain class of naturally occuring problems involving an oracle are solvable in random polynomial time, but not in deterministic polynomial time. This class of problems is especially interesting because a very slight change in the parameters of the problem yields one that does have a polynomial solution.