An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time
Permanent Link(s)
Collections
Author
Zippel, Richard
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.
Date Issued
1989-02
Publisher
Cornell University
Keywords
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-965
Type
technical report