Theoretical Computer Science
Meta user
Network profile
9,242
reputation
32
83

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.

109
answers
56
questions
~84k
people reached
  • Budapest, Hungary
  • domotorp.web.elte.hu
  • Member for 9 years, 1 month
  • 1,473 profile views
  • Last seen 16 hours ago

Communities (31)

Top Meta Posts
2
2

Top network posts

Top tags (142)

Score 211
Posts 72
Posts % 44
Score 87
Posts 24
Score 70
Posts 15
Score 67
Posts 18
Score 63
Posts 18
Score 59
Posts 17
View all tags →

Top posts (165) All Questions Answers | Votes Newest

32 Does LOGLOG = NLOGLOG? Dec 24 '10
30 Is there a natural problem on the naturals that is NP-complete? Oct 30 '12
28 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
21 What is the minimum size of a circuit that computes PARITY? Oct 10 '14
21 Are shift-chains two-colorable? Nov 12 '10
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 (115)

Gold

—

Silver

32

Rarest

Bronze

83

Rarest

View all badges →