Theoretical Computer Science
Meta user
Network profile
1,868
reputation
11
12

Daniel Marx

Apparently, this user prefers to keep an air of mystery about them.

18
answers
0
questions
~20k
people reached
  • cs.bme.hu/~dmarx
  • Member for 9 years
  • 281 profile views
  • Last seen May 21 '16 at 20:46

Communities (2)

Top network posts

Top tags (24)

Score 91
Posts 8
Posts % 44
Score 80
Posts 9
Score 42
Posts 3
Score 37
Posts 4
Score 34
Posts 5
Score 27
Posts 2
View all tags →

Top posts (18) All Questions Answers | Votes Newest

29 If you could rename dynamic programming… Mar 27 '11
20 Small steps for better TCS conferences? May 14 '11
19 What does 'gadget' mean in NP-hard reduction? Nov 28 '11
16 What separates easy global problems from hard global problems on graphs of bounded treewidth? Sep 25 '14
15 Curious about computer-assisted NP-completeness proofs Feb 2 '15
14 Existence of $opt^c$-approximation of Dominating Set with $c < 1$? Mar 30 '11
13 “Directed” problems that are easier than their “undirected” variant. Dec 3 '11
11 Is there any problem in $\mathsf{\Sigma^P_2}$ which is solvable in bounded tree width graphs? Oct 20 '11
9 Algebraic formulation for packing problem Feb 5 '12
9 Parametrized Complexity of Counting Bicliques Apr 10 '12
View all questions and answers →

Badges (23)

Gold

—

Silver

11

Rarest

Bronze

12

Rarest

View all badges →