Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.date.accessioned2007-04-23T16:43:22Z
dc.date.available2007-04-23T16:43:22Z
dc.date.issued1982-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-484en_US
dc.identifier.urihttps://hdl.handle.net/1813/6324
dc.description.abstractThis paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME,$\ldots,\Sigma^{P}_{k}, \ldots,$ PTAPE.en_US
dc.format.extent1386255 bytes
dc.format.extent353591 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.titleOn the Structure of Feasible Computationsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics