An explicit separation of relativised random polynomial time and relativised deterministic polynomial time

Abstract

In this note we demonstrate that a certain class of naturally occurring 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.