# existence of $DLOGTIME$-complete problems

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.)

-
This question might be better suited for cstheory.stackexchange.com –  Quinn Culver May 23 '12 at 3:14
@Quinn, Theoretical Computer Science is for research level questions, non-research level questions in TCS should be directed to Computer Science in place of Theoretical Computer Science. –  Kaveh May 24 '12 at 5:14
@Kaveh Good to know. Thanks. –  Quinn Culver May 24 '12 at 13:05