Theoretical Computer Science
Meta user
Network profile
136
reputation
5

Dominik Peters

I'm a PhD student in Computer Science in Oxford, working on algorithmic game theory and computational social choice. I like hardness proofs. During undergrad, I had a focus on Foundations of Mathematics.

0
answers
4
questions
~941
people reached
  • Oxford
  • Member for 7 years
  • 25 profile views
  • Last seen May 1 at 8:16

Communities (13)

Top network posts

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

Badges (5)

Gold

—

Silver

—

Bronze

5

Rarest