Theoretical Computer Science
Michaël Cadilhac
Profile Activity
Stats
3,796
reputation
245k
reached
20
answers
19
questions
Communities
View all
About

Assistant professor of computer science at DePaul University.

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

Badges
View all badges
This user doesn’t have any gold badges yet.
20
silver badges
37
bronze badges
Top tags
View all 43 tags
53
Score
16
Posts
41
Posts %
53
Score
12
Posts
31
Posts %
51
Score
9
Posts
23
Posts %
36
Score
5
Posts
13
Posts %
34
Score
6
Posts
15
Posts %
19
Score
5
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
47
An NP-complete variant of factoring.
Feb 7 '11
30
What papers should everyone read?
Sep 12 '10
19
What videos should everybody watch?
Sep 12 '10
19
To what extent MSO = WS1S, when adding relations?
Aug 16 '10
17
Which $AC^0$ problems are not "truly feasible"?
Sep 1 '10
16
Compared growth of the number of syntactic classes and Nerode classes.
Aug 17 '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
Top network posts
View all
32
find(1): how is the star wildcard implemented for it to fail on some filenames?
28
FO-definability of the integers in (Q, +, <)
23
Which recursively-defined predicates can be expressed in Presburger Arithmetic?
18
For a linear recurrence sequence $(u_n)_{n\geq 0}$, can $\{i \mid u_i > 0\}$ be the set of Fibonacci numbers?
13
Rotate a node but not its content: the case of the ellipse decoration

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.