Computer Science
user2145167
  • Member for 8 years, 10 months
  • Last seen more than 8 years ago
Profile Activity
Stats
673
reputation
10k
reached
0
answers
6
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
13
bronze badges
Top tags
View all tags
0
Score
4
Posts
67
Posts %
0
Score
4
Posts
67
Posts %
0
Score
3
Posts
50
Posts %
0
Score
2
Posts
33
Posts %
0
Score
2
Posts
33
Posts %
0
Score
2
Posts
33
Posts %
Top posts
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
Top network posts
View all network posts
9
Hermite Polynomials Triple Product

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.