I had an interview today, and the interviewer has told me about a theorem (of someone called Hill- or Hell-something) which states that for a non-deterministic algorithm there exists a deterministic algorithm of some time complexity and a space complexity of no more than the original space complexity times log(n).I am looking for that theorem (couldn't find it on Google). Thanks!
Logarithmic space difference between deterministic and non-deterministic algorithms
algorithms;space complexity;nondeterminism