Skip to main content
Theoretical Computer Science
Dominik Peters's user avatar
Dominik Peters's user avatar
Dominik Peters's user avatar
Dominik Peters
  • Member for 12 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
391
reputation
3k
reached
0
answers
4
questions
Communities
View all
About

I'm a CNRS researcher in computer science at Université Paris Dauphine / LAMSADE, working on computational social choice.

Badges
View all badges
This user doesn’t have any gold badges yet.
1
silver badge
7
bronze badges
Top tags
View all tags
0
Score
3
Posts
75
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
Top posts
question
10
Does 1-in-3 SAT remain NP-hard even if every variable occurs both positively and negatively?
Jul 11, 2015
question
10
Hardness in P: methods to show optimality of $O(m^2n)$-like time?
Dec 21, 2015
question
5
Are there integer programs with small coefficients that only have large solutions?
Apr 14, 2016
question
4
When is $FP^{NP[f(n)]}$ the same as $FP^{NP}$?
Aug 29, 2015
Top network posts
View all network posts
20
xmark that complements the ams checkmark
15
Is there a TikZ and PGFplot HTML manual online?
13
Does eating in a mixed buffet drive up meat demand, even if I only eat vegetarian dishes?
11
SAT solving with more than 2^32 clauses
9
CLRS - Maxflow Augmented Flow Lemma 26.1 - don't understand use of def. in proof