The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
| dc.creator | Blass,Andreas | |
| dc.creator | Gurevich,Yuri | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:48:46Z | |
| dc.date.available | 2024-02-06T12:48:46Z | |
| dc.description | We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-04-0247 | |
| dc.identifier | https://lib.jucs.org/article/27348/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7138 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(4): 247-278 | |
| dc.title | The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs | |
| dc.type | Research Article |