An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time
MetadataShow full item record
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.
computer science; technical report
Previously Published As