8
$\begingroup$

Is there any decision problem that is in a complexity class properly included in DLOGTIME? (except $O(1)$, of course)

If there is, can we create complete problems for DLOGTIME? So, can there be reduction by $O(\log(\log n))$ or smaller?

$\endgroup$
3
$\begingroup$

Regan & Vollmer suggest in the conclusion of the linked paper that such classes are constructible (though fiddly). The paper itself is about LOGTIME, and mentions where changes have to be made to adapt the results to LOGLOGTIME, LOGLOGLOGTIME etc., but don't explicitly demonstrate the results.

| cite | improve this answer | |
$\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.