@inproceedings{10.1145/800133.804352,
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 2εn or nondeterministic time 2εn2 for some constant ε \> O and infinitely many n.The proof is based on the families of languages TISP(T(n),S(n)) which can be recognized simultaneously in time T(n) and space S(n) and the conditions under which they form a hierarchy.},
Address = {New York, NY, USA},
Author = {Bruss, Anni R. and Meyer, Albert R.},
BookTitle = {Proceedings of the Tenth Annual ACM Symposium on Theory of Computing},
File = {On Time-Space Classes and Their Relation to the Theory of Real Addition - bruss1978.pdf},
ISBN = {9781450374378},
Location = {San Diego, California, USA},
Pages = {233--239},
Publisher = {Association for Computing Machinery},
Series = {STOC '78},
Title = {On Time-Space Classes and Their Relation to the Theory of Real Addition},
URL = {https://doi.org/10.1145/800133.804352},
Year = {1978},
bdsk-url-1 = {https://doi.org/10.1145/800133.804352},
date-added = {2022-01-06 08:45:02 +0100},
date-modified = {2022-01-06 08:45:02 +0100},
file-2 = {On Time-Space Classes and Their Relation to the Theory of Real Addition - 81116103.pdf},
numpages = {7},
doi = {10.1145/800133.804352}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A