Theoretical Computer Science
Profile Activity
Meta user
Network profile
13,208
reputation
33
90

domotorp

I work at ELTE, Budapest, in the MTA-ELTE Combinatorial Geometry Research Group. I'm primarily interested in combinatorial geometry, complexity theory and combinatorics.

121
answers
64
questions
~100k
people reached
  • Budapest, Hungary
  • domotorp.web.elte.hu
  • Member for 10 years, 8 months
  • 1,670 profile views
  • Last seen 3 hours ago

Communities (34)

Top Meta Posts
2
2

Top network posts

Top tags (153)

Score 238
Posts 79
Posts % 43
Score 88
Posts 24
Score 71
Posts 21
Score 70
Posts 15
Score 68
Posts 21
Score 68
Posts 18
View all tags →

Top posts (185)

All Questions Answers
Votes Newest
33 Does LOGLOG = NLOGLOG? Dec 24 '10
31 Is there a natural problem on the naturals that is NP-complete? Oct 30 '12
31 What is simplest polynomial algorithm for PLANARITY? Jun 22 '14
28 Can we not output the Kolmogorov complexity? Apr 26 '15
28 Does Babai's quasipolynomial time $\mathsf{GI}$ algorithm actually generate the isomorphism? Dec 24 '17
25 Coloring Planar Graphs Dec 30 '10
23 Are shift-chains two-colorable? Nov 12 '10
21 What is the minimum size of a circuit that computes PARITY? Oct 10 '14
20 Positive topological ordering, take 3 Oct 1 '10
20 Can any computational challenge be transformed to proof-of-work? Dec 28 '17
View all questions and answers →

Badges (123)

Gold

—

Silver

33

Rarest

Bronze

90

Rarest

View all badges →

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.