Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > NON-DETERMINISTIC TIME:
Reports tagged with non-deterministic time:
TR14-171 | 11th December 2014
Lance Fortnow, Rahul Santhanam

$c$ and $d$ such that $1 \leq c < d$, there is a language in $\NTIME(n^d)$
which is not in $\NTIME(n^c)/n^{1/d}$. ... more >>>