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.)
Asked
Active
Viewed 74 times
1
-
This question might be better suited for http://cstheory.stackexchange.com/ – Quinn Culver May 23 '12 at 03:14
-
@Quinn, [cstheory.se] is for research level questions, non-research level questions in TCS should be directed to [cs.se] in place of [cstheory.se]. – Kaveh May 24 '12 at 05:14
-
@Kaveh Good to know. Thanks. – Quinn Culver May 24 '12 at 13:05