An O (T log T) Reduction from RAM Computations to Satisfiability

Abstract A new method is given for obtaining a boolean expression whose satisfiability is equivalent to the existence of an accepting computation of some nondeterministic machine. Although starting from random access machines, this method gives an expression of the same O( T log T ) length as the best reduction from general Turing machines.