|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/7111
| Title: | On Polynomial Time Isomorphism of Complete Sets |
| Authors: | Berman, L.
Hartmanis, Juris |
| Keywords: | computer science
technical report |
| Issue Date: | Dec-1976 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-297 |
| Abstract: | IN this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory and EXPTAPE complete sets arising from algebraic word problems are polynomial time isomorphic to the previously known complete sets in the corresponding categories. |
| URI: | http://hdl.handle.net/1813/7111 |
| Appears in Collections: | Computer Science Technical Reports
Hartmanis, Juris
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
