Results from the 2022 Developer Survey are now available
Theoretical Computer Science
user avatar
user avatar
user avatar
Daniel Marx
  • Member for 11 years, 5 months
  • Last seen more than 6 years ago
Profile Activity
Stats
1,968
reputation
23k
reached
18
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
12
silver badges
12
bronze badges
Top tags
View all tags
101
Score
8
Posts
44
Posts %
81
Score
9
Posts
50
Posts %
50
Score
3
Posts
17
Posts %
37
Score
4
Posts
22
Posts %
35
Score
2
Posts
11
Posts %
34
Score
5
Posts
28
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
35
If you could rename dynamic programming...
Mar 27, 2011
answer
26
What does 'gadget' mean in NP-hard reduction?
Nov 28, 2011
answer
20
Small steps for better TCS conferences?
May 14, 2011
answer
16
What separates easy global problems from hard global problems on graphs of bounded treewidth?
Sep 25, 2014
answer
15
Curious about computer-assisted NP-completeness proofs
Feb 2, 2015
answer
15
Existence of $opt^c$-approximation of Dominating Set with $c < 1$?
Mar 30, 2011
answer
13
"Directed" problems that are easier than their "undirected" variant.
Dec 3, 2011
answer
11
Is there any problem in $\mathsf{\Sigma^P_2}$ which is solvable in bounded tree width graphs?
Oct 20, 2011
answer
9
Algebraic formulation for packing problem
Feb 5, 2012
answer
9
Instance of FPT-reductions that is not a polynomial-time reduction
Jan 12, 2011
Top network posts
View all network posts
11
RefTeX: shortcut to open the .bib file of the current document

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.