Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
Computer Science
Meta user
Network profile
663
reputation
4
12

user2145167

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

0
answers
6
questions
~7k
people reached
  • Member for 6 years, 8 months
  • 15 profile views
  • Last seen Jul 9 '13 at 9:57

Communities (4)

Top network posts

Top tags (15)

Score 0
Posts 4
Posts % 67
Score 0
Posts 4
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 2
View all tags →

Top posts (6) All Questions Answers | Votes Newest

19 Can one show NP-hardness by Turing reductions? Apr 8 '13
14 How to practically construct regular expander graphs? Apr 24 '13
12 Does the complexity of strongly NP-hard or -complete problems change when their input is unary encoded? Mar 16 '13
7 NP complete problems that are solvable in polynomial time if the input (e.g. number of variables) is fixed? May 3 '13
2 Why are optimization problems always NP-hard and not NP-complete and what does this mean for other levels of the polynomial time hierarchy? [duplicate] Mar 21 '13
2 Polynomial time reductions using binary search Mar 25 '13

Badges (16)

Gold

—

Silver

4

Rarest

Bronze

12

Rarest

View all badges →