Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,948
reputation
12
12

Daniel Marx

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

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

Communities (2)

Top network posts

Top tags (0)

This user has not participated in any tags.

Top posts (18)

All Questions Answers
Votes Newest
32 If you could rename dynamic programming… Mar 27 '11
25 What does 'gadget' mean in NP-hard reduction? Nov 28 '11
20 Small steps for better TCS conferences? May 14 '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 Instance of FPT-reductions that is not a polynomial-time reduction Jan 12 '11
View all questions and answers →

Badges (24)

Gold

—

Silver

12

Rarest

Bronze

12

Rarest

View all badges →