On Time-space Classes and Their Relation to the Theory of Real Addition

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.