About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Computer and System Sciences
Paper
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Abstract
Our computational model is a random access machine with n read only input registers each containing c log n bits of information and a read and write memory. We measure the time by the number of accesses to the input registers. We show that for all k there is an ε > 0 so that if n is sufficiently large then the elements distinctness problem cannot be solved in time kn with en bits of read and write memory; that is, there is no machine with this value of the parameters which decides whether there are two different input registers whose contents are identical. © 2002 Elsevier Science (USA) All rights reserved.