Theoretical Computer Science
Meta user
Network profile
2,631
reputation
18
36

Michaël Cadilhac

Assistant professor of computer science at DePaul University.

Theoretical computer sciencist. Main interests in language theory, circuit complexity, algebraic language theory, and descriptive complexity.

20
answers
19
questions
~222k
people reached

Communities (27)

Top network posts

Top tags (43)

Score 52
Posts 12
Posts % 31
Score 51
Posts 16
Score 49
Posts 9
Score 36
Posts 5
Score 31
Posts 6
Score 19
Posts 5
View all tags →

Top posts (39) All Questions Answers | Votes Newest

45 An NP-complete variant of factoring. Feb 7 '11
30 What papers should everyone read? Sep 12 '10
18 What videos should everybody watch? Sep 12 '10
18 To what extent MSO = WS1S, when adding relations? Aug 16 '10
16 Compared growth of the number of syntactic classes and Nerode classes. Aug 17 '10
16 Which $AC^0$ problems are not “truly feasible”? Sep 1 '10
16 Completeness and Context-Sensitive Languages. Oct 3 '10
16 (False?) proof for computability of a function? Oct 6 '10
15 Regular language that discriminates between two deterministic CFGs Dec 16 '17
14 Finding a finite model Apr 13 '11
View all questions and answers →

Badges (54)

Gold

—

Silver

18

Rarest

Bronze

36

Rarest

View all badges →