Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.contributor.authorHopcroft, John E.en_US
dc.date.accessioned2007-04-09T21:01:57Z
dc.date.available2007-04-09T21:01:57Z
dc.date.issued1968-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-20en_US
dc.identifier.urihttps://hdl.handle.net/1813/5873
dc.description.abstractIt is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$ and cannot be performed by any multitape Turing machine in time $T(n)$.en_US
dc.format.extent247901 bytes
dc.format.extent143868 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.titleRefinement of Hierarchies of Time Bounded 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