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.
3
answers
0
questions
0
people reached
-
Chicago, Illinois, USA
-
Member for 10 years, 6 months
-
28 profile views
-
Last seen Jan 14 '19 at 22:54
Communities (30)
- Theoretical Computer Science 3.8k 3.8k 1919 silver badges3737 bronze badges
- TeX - LaTeX 1.2k 1.2k 88 silver badges1818 bronze badges
- Mathematics 934 934 77 silver badges1818 bronze badges
- MathOverflow 746 746 33 silver badges1212 bronze badges
- Unix & Linux 654 654 55 silver badges1616 bronze badges
- View network profile
Top network posts
- 46 An NP-complete variant of factoring.
- 32 find(1): how is the star wildcard implemented for it to fail on some filenames?
- 30 What papers should everyone read?
- 28 FO-definability of the integers in (Q, +, <)
- 22 Which recursively-defined predicates can be expressed in Presburger Arithmetic?
- 19 What videos should everybody watch?
- 19 To what extent MSO = WS1S, when adding relations?
- View more network posts →
Top tags (6)
Score
2
Posts
1
Posts %
33
Score
2
Posts
1
Score
2
Posts
1
Badges (13)
Gold
—
Silver
10
Rarest
Bronze
3
Rarest
-
Aug 17 '10
-
Aug 16 '10
-
Aug 16 '10