Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.contributor.authorMahaney, Stephen R.en_US
dc.date.accessioned2007-04-23T16:39:20Z
dc.date.available2007-04-23T16:39:20Z
dc.date.issued1980-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-422en_US
dc.identifier.urihttps://hdl.handle.net/1813/6262
dc.description.abstractThe 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.extent1062641 bytes
dc.format.extent309409 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Essay About Research on Sparse NP Complete Setsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics