57 citations · 59 across the 12 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2013
Arbitrary Sequence RAMs
Michael Brand
It is known that in some cases a Random Access Machine (RAM) benefits from having an additional input that is an arbitrary number, satisfying only the criterion of being sufficient…
cs.CC2013
The RAM equivalent of P vs. RP
Michael Brand
One of the fundamental open questions in computational complexity is whether the class of problems solvable by use of stochasticity under the Random Polynomial time (RP) model is l…
cs.CC2013
Computing with and without arbitrary large numbers
Michael Brand
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, i…