Abstract

It is shown that for some languages no oracle (or only oracles with exponential density—depending on the way in which the space complexity in oracle computations is measured) can help to decrease their time-space complexity. This result is shown to be to some extent independent of the machine model used (single-tape, multitape, or multihead Turing machines, RAMs, etc.)

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call