Computer Science
user2145167
  • Member for 8 years, 7 months
Profile Activity
Stats
673
reputation
10k
reached
0
answers
6
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (4)

Top network posts

This user doesn’t have any gold badges yet.
4
silver badges
13
bronze badges
View all badges

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
20 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

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.