Key points are not available for this paper at this time.
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 2εn or nondeterministic time 2εn2 for some constant ε > O and infinitely many n.
Bruss et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: