Just curious - is there any problem that can be considered as $DLOGTIME$-complete? Or if not, has it been proven that there does not exist a complete class? (By being complete, I mean that it has lower time/space reduction available - as used conventionally.)
existence of $DLOGTIME$-complete problems
1
$\begingroup$
computational-complexity
-
0@Kaveh Good to know. Thanks. – 2012-05-24