Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

share|cite|improve this question
This question might be better suited for – 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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.