2
$\begingroup$

I have being reading up on complexity classes (in Rieffel & Polak, 2011; pg149). I am slightly confused about something. Does for example $P$ (DTime($n^k$)) include all problems that can be solved faster then polynomial in time (e.g. logarithmic) on a deterministic Turing? And likewise for e.g. PSpace (DSpace($n^k$)) and NP (NDTime($n^k$)) etc.?

$\endgroup$

migrated from cstheory.stackexchange.com May 15 '18 at 0:43

This question came from our site for theoretical computer scientists and researchers in related fields.

3
$\begingroup$

We have $$\mathsf{P} = \bigcup_{k \in \mathbb{N}} DTIME(n^k)$$ And e.g. $\log n \in \mathcal{O}(n)$. Thus, problems which are solvable in deterministic logarithmic time are in $\mathsf{P}$ since they are in $DTIME(n)$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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