Factoring and testing primes in small space
Viliam Geffert, Dana Pardubská (2013)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We discuss how much space is sufficient to decide whether a unary given number is a prime. We show that (log log ) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. In other words, the language is a prime is in pebble–DSPACE(log log ) and also in accept–ASPACE(log log ). Moreover, if the given...