On Time-space Classes and Their Relation to the Theory of Real Addition
| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Bruss, Anna R. | en_US |
| dc.date.accessioned | 2023-03-29T15:01:57Z | |
| dc.date.available | 2023-03-29T15:01:57Z | |
| dc.date.issued | 1978-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149484 | |
| dc.description.abstract | A new lower bound on the computational complexity of the theory of real addition and several related theories is established: any decision procedure for these theories requires either space n2 or nondeterministic time 2en2 for some constant E> 0 and infinitely many n. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-195 | |
| dc.title | On Time-space Classes and Their Relation to the Theory of Real Addition | en_US |
| dc.identifier.oclc | 03867429 |
