Theoretical Computer Science
Dominik Peters
Profile Activity
Stats
371
reputation
1k
reached
0
answers
4
questions
About

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

Communities (15)

Top network posts

This user doesn’t have any gold badges yet.
1
silver badge
5
bronze badges

Top tags (9)

Score 0
Posts 3
Posts % 75
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (4)

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

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.