Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time

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

File(s)
89-965.ps (187.97 KB)
89-965.pdf (765.92 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6881
Collections
Computer Science Technical Reports
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
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-965
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance