Theoretical Computer Science
Profile Activity
Meta user
Network profile
371
reputation
1
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
~1k
people reached
  • Oxford
  • Member for 8 years, 7 months
  • 30 profile views
  • Last seen Dec 4 '20 at 20:47

Communities (14)

Top network posts

Top tags (0)

This user has not participated in any 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 (6)

Gold

—

Silver

1

Rarest

Bronze

5

Rarest