|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6324
| Title: | On the Structure of Feasible Computations |
| Authors: | Hartmanis, Juris |
| Keywords: | computer science
technical report |
| Issue Date: | Mar-1982 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-484 |
| Abstract: | This 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. |
| URI: | http://hdl.handle.net/1813/6324 |
| Appears in Collections: | Computer Science Technical Reports
Hartmanis, Juris
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
