ABSTRACT
For each natural number d we consider a finite structure Md whose universe is the set of all 0,1-sequence of length n=2d, each representing a natural number in the set {0,1,...,2n-1} in binary form. The operations included in the structure are the four constants 0,1,2n-1,n, multiplication and addition modulo 2n, the unary function min{2x, 2n-1}, the binary functions ⌊ x/y⌋ (with ⌊ x/0 ⌋ =0), max(x,y), min(x,y), and the boolean vector operations, vee,- defined on 0,1 sequences of length n, by performing the operations on all components simultaneously. These are essentially the arithmetic operations that can be performed on a RAM, with wordlength n, by a single instruction. We show that there exists an ε>0 and a term (that is, an algebraic expression) F(x,y) built up from the mentioned operations, with the only free variables x,y, such that if Gd(y), d=0,1,2,..., is a sequence of terms, and for all d=0,1,2,..., Md models ∀ x, [Gd(x)-> ∃ y, F(x,y)=0], then for infinitely many integers d, the depth of the term Gd, that is, the maximal number of nestings of the operations in it, is at least ε (log d)1/2 = ε (log log n)1/2.
The following is a consequence. We are considering RAMs Nn, with wordlength n=2d, whose arithmetic instructions are the arithmetic operations listed above, and also have the usual other RAM instructions. The size of the memory is restricted only by the address space, that is, it is 2n words. The RAMs has a finite instruction set, each instruction is encoded by a fixed natural number independently of n. Therefore a program P can run on each machine Nn, if n=2d is sufficiently large. We show that there exists an ε>0 and a program P, such that it satisfies the following two conditions. (i) For all sufficiently large n=2d, if P running on Nn gets an input consisting of two words a and b, then, in constant time, it gives a 0,1 output Pn(a,b). (ii) Suppose that Q is a program such that for each sufficiently large n=2d, if Q, running on Nn, gets a word a of length n as an input, then it decides whether there exists a word b of length n such that Pn(a,b)=0. Then, for infinitely many positive integers d, there exists a word a of length n=2d, such that the running time of Q on Nn at input a is at least ε (log d)1/2 (log log d)-1 ≥ (log d)1/2-ε= (log log n)1/2-ε.
- .V. Aho, J.E. Hopcroft, J.D. Ullman, The Design andAnalysis of Computer Algorithms, Addison-Wesley, 1974. Google ScholarDigital Library
- . Ajtai. Detreminism versus Nondeterminism with Arithmetic Tests and Computation,Proceedings of the 44th ACM Symposium on Theory of Computing, STOC 2012,New York, NY, USA, June 2012, pages 249--268 ACM,2012., see also Electronic Colloquium on Computational Complexity (ECCC), 2012 Google ScholarDigital Library
- . Ajtai, Determinism versus Nondeterminism forLinear Time RAMs with Memory Restrictions, Journal of Computer andSystems Science, 65(1): 2--37, (2002) Google ScholarDigital Library
- M. Ajtai, Oblivious $RAM$s without cryptographic assumptions, Electronic Colloquium on Computational Complexity (ECCC),17:28, 2010.Google Scholar
- . Ajtai. Oblivious $RAM$s without cryptographic assumptions,Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010,Cambridge, Massachusetts, USA, 5--8 June 2010, pages 181--190. ACM,2010. Google ScholarDigital Library
- E. Artin. Galois Theory, Dover Publications, 1998.(Reprinting of second revised edition of 1944, The University of NotreDame Press).Google Scholar
- P. Beame, S. A. Cook, and H. J. Hoover, Log Depth Circuits for Division and Related Problems, SIAM Journal on Computing, 15(4):994--1003, November 1986. Google ScholarDigital Library
- . Beame, T. S. Jayram, M. Sacks, Time-space tradeoffs for branching programs, Journal of Computer and Systems Science,63(4):542--572, December 2001. Google ScholarDigital Library
- . Beame, M. Sacks, Xiadong Sun, E. Vee, Time-space trade-off lower bounds for randomized computation of decision problems,Journal of ACM, 50(2):154--195,2003. Google ScholarDigital Library
- M. Davis, H. Putnam and J. Robinson, The decision problem for exponential diophantine equations, Ann. of Math. (2) 74 (1961),425--436. 3. J. P. Jones, Three universal representations of r.e. sets,J. Symbolic Logic 43 (1978), 335--351.Google ScholarCross Ref
- W. Hesse, Division is in Uniform $TC^0$, ICALP 2001: 104--114. Google ScholarDigital Library
- . Hopcroft, W. Paul, L. Valiant, On Time Versus Space,Journal of ACM, 24(2):332--337,April 1977. Google ScholarDigital Library
- L. Fortnow, Time-space trade offs for satisfiability, Journal of Computer and System Sciences, 60:337--353, 2000. Google ScholarCross Ref
- Ju. V. Matijasevic, Enumerable sets are diophantine, Dokl. Akad.Nauk SSSR 191 (1970), 279--282. English transi.: Soviet Math. Doklady11 (1970), 354--358.Google Scholar
- . Paul, N. Pippenger, E. Szemerédi, and W. Trotter. On determinism versus non determinism and related problems,In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 429--438. IEEE, New York, 1983. Google ScholarDigital Library
- . Takeuti, Proof Theory,North-Holland, Studies in Logic and the Foundations of Mathematics, Vol. 81, Second edition, 1987.Google Scholar
Index Terms
- Lower bounds for RAMs and quantifier elimination
Recommendations
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on time-space trade-offs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median requires Ω(nlog logS n) expected time in the RAM model (or more generally ...
Distributed Lower Bounds for Ruling Sets
Given a graph $G=(V,E)$, an $(\alpha,\beta)$-ruling set is a subset $S\subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is at most $\beta$. We ...
Tight Bounds for Adopt-Commit Objects
We give matching upper and lower bounds of $\varTheta(\min(\frac{\log m}{\log \log m},\, n))$ for the individual step complexity of a wait-free m -valued adopt-commit object implemented using multi-writer registers for n anonymous processes. While the upper bound is deterministic, the lower bound ...
Comments