Skip to main content
Theoretical Computer Science
Ronald de Haan's user avatar
Ronald de Haan's user avatar
Ronald de Haan's user avatar
Ronald de Haan
  • Member for 7 years, 5 months
  • Last seen more than 3 years ago
Profile Activity
Stats
396
reputation
1k
reached
5
answers
0
questions
Communities
About

I'm a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam. My research interests revolve around computational complexity theory (and parameterized complexity theory in particular).

Badges
This user doesn’t have any gold badges yet.
1
silver badge
6
bronze badges
Top tags
View all tags
25
Score
4
Posts
80
Posts %
12
Score
2
Posts
40
Posts %
7
Score
1
Posts
20
Posts %
7
Score
1
Posts
20
Posts %
6
Score
2
Posts
40
Posts %
6
Score
1
Posts
20
Posts %
Top posts
answer
7
Dp completeness of a problem
Jul 13, 2017
answer
6
Fixed parameter tractable Integer Programming and $FPP$
Jul 13, 2017
answer
6
Name for "uniformly polynomial" subclass of XP?
Jul 13, 2017
answer
6
Are there any parameterized problems in non-uniform FPT that are suspected (but not proven) to be in uniform-FPT?
Sep 20, 2017
answer
4
What are the recent TCS books whose drafts are available online?
Sep 6, 2017