Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
THE COMPUTATIONAL COMPLEXITY OF SOME LOGICAL THEORIES
THE COMPUTATIONAL COMPLEXITY OF SOME LOGICAL THEORIES
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Formal languages and their relation to automata
Formal languages and their relation to automata
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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&egr;n or nondeterministic time 2&egr;n2 for some constant &egr; 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.