Is there any known NP-Complete (or NP-Intermediate) problem in sublinear nondeterministic space? There are some NP-Complete problems ($ \mathsf{SAT} $, $ \mathsf{SUBSETSUM} $, etc.) known to be in $ \mathsf{DSPACE(n)} $. What about the sub-linear spaces?


  Is there any known NP-Complete (or NP-Intermediate) problem in sublinear nondeterministic space?
The planar version of many NP-complete problems belong to $NTISP(n,n^q)$ for some $q&lt;1$

See for example "Lower Bounds and Complete Problems in Nondeterministic Linear Time and
Sublinear Space Complexity Classes" by P. Chapdelaine and E. Grandjean (2006)