On Polynomial Time Isomorphism of Complete Sets
| dc.contributor.author | Berman, L. | en_US |
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.date.accessioned | 2007-04-23T17:58:00Z | |
| dc.date.available | 2007-04-23T17:58:00Z | |
| dc.date.issued | 1976-12 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 726072 bytes | |
| dc.format.extent | 466286 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-297 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7111 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On Polynomial Time Isomorphism of Complete Sets | en_US |
| dc.type | technical report | en_US |