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. On Polynomial Time Isomorphism of Complete Sets

On Polynomial Time Isomorphism of Complete Sets

File(s)
76-297.ps (455.36 KB)
76-297.pdf (709.05 KB)
Permanent Link(s)
https://hdl.handle.net/1813/7111
Collections
Computer Science Technical Reports
Hartmanis, Juris
Author
Berman, L.
Hartmanis, Juris
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.

Date Issued
1976-12
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-297
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

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