Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I want to show that reasonable advice can really speed up computation.

Show, that every time-constructible function $t$, there exists a set $S$ in time $\text{DTIME}(t^2) \setminus \text{DTIME}(t)$ that can be decided in linear time using an advice of linear length, $S \in \text{DTIME}(l) / l$ (definition in analogy to $P / \text{poly}$), where $l(n)=O(n)$.

The problem is that I cannot come up with the structure of set.

share|cite|improve this question
up vote 1 down vote accepted

Hint: Start with a problem in $\mathrm{DTIME}(e^{2t}) \setminus \mathrm{DTIME}(e^t)$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.