JavaScript is disabled for your browser. Some features of this site may not work without it.
An Essay About Research on Sparse NP Complete Sets
dc.contributor.author | Hartmanis, Juris | en_US |
dc.contributor.author | Mahaney, Stephen R. | en_US |
dc.date.accessioned | 2007-04-23T16:39:20Z | |
dc.date.available | 2007-04-23T16:39:20Z | |
dc.date.issued | 1980-05 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-422 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6262 | |
dc.description.abstract | The purpose of this paper is to review the origins and motivation for the conjecture that sparse NP complete sets do not exist (unless P=NP) and to describe the development of the ideas and techniques which led to the recent solution of this conjecture. | en_US |
dc.format.extent | 1062641 bytes | |
dc.format.extent | 309409 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
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 | An Essay About Research on Sparse NP Complete Sets | en_US |
dc.type | technical report | en_US |