Theoretical Computer Science
Dominik Peters
  • Member for 9 years, 7 months
  • Last seen more than a month ago
Profile Activity
Stats
371
reputation
1k
reached
0
answers
4
questions
Communities
View all
About

I'm a postdoc in computer science at Harvard, working on computational social choice.

Badges
This user doesn’t have any gold badges yet.
1
silver badge
5
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
All Questions Answers
Votes Newest
10
Hardness in P: methods to show optimality of $O(m^2n)$-like time?
Dec 21 '15
9
Does 1-in-3 SAT remain NP-hard even if every variable occurs both positively and negatively?
Jul 11 '15
4
When is $FP^{NP[f(n)]}$ the same as $FP^{NP}$?
Aug 29 '15
4
Are there integer programs with small coefficients that only have large solutions?
Apr 14 '16
Top network posts
View all network posts
13
Does eating in a mixed buffet drive up meat demand, even if I only eat vegetarian dishes?
11
Is there a TikZ and PGFplot HTML manual online?
10
SAT solving with more than 2^32 clauses
9
CLRS - Maxflow Augmented Flow Lemma 26.1 - don't understand use of def. in proof
7
Any Natural Problems shown Easy by Reduction to Horn SAT?

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.