|Nice Question||Question score of 10 or more. This badge can be awarded multiple times.|
Michaël Cadilhac earned this badge 8 times
sep 17 at 3:05Space-time tradeoff lower bounds
nov 23 '11 at 17:05When does an FO property kill off NL-hardness?
feb 20 '11 at 23:04To what extent MSO = WS1S, when adding relations?
feb 8 '11 at 8:02An NP-complete variant of factoring.
jan 15 '11 at 22:15Compared growth of the number of syntactic classes and Nerode classes.
nov 15 '10 at 17:18Which $AC^0$ problems are not “truly feasible” ?
oct 10 '10 at 20:19Completeness and Context-Sensitive Languages.