On Time-space Classes and Their Relation to the Theory of Real Addition
Name
MIT-LCS-TR-195.pdf
Size
967.62 KB
Format
Adobe PDF
Checksum (MD5)
7158d9cdbe1d9e945eac74c509df07c7
Author(s)
Bruss, Anna R.
Advisor(s)
Meyer, Albert R.
Date Issued
March 1978
Series/Report no.
MIT-LCS-TR-195
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.
Persistent DSpace Link