Theoretical Computer Science
user1105's user avatar
user1105's user avatar
user1105's user avatar
user1105
  • Member for 10 years, 2 months
  • Last seen more than 4 years ago
Profile Activity
Stats
181
reputation
2k
reached
2
answers
4
questions
Communities
View all
About

I may not be there yet, but I'm closer than I was yesterday.

Badges
View all badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
13
bronze badges
Top tags
View all tags
2
Score
3
Posts
50
Posts %
2
Score
1
Posts
17
Posts %
2
Score
1
Posts
17
Posts %
0
Score
2
Posts
33
Posts %
0
Score
3
Posts
50
Posts %
0
Score
3
Posts
50
Posts %
Top posts
All Questions Answers
Score Newest
question
7
$d$-regular bipartite expander graph
Jun 11, 2015
question
7
What are some of the most ingenious linear programs developed for tackling hard combinatorial problems?
Jul 1, 2015
answer
5
What are some of the most ingenious linear programs developed for tackling hard combinatorial problems?
Jul 1, 2015
question
3
What is the relationship between $\mathsf{APX}$ and $\mathsf{MaxSNP}$ classes?
Jan 23, 2015
question
3
$\mathsf{APX}-\mathsf{Hard}$ and $\mathsf{MaxSNP}-\mathsf{Hard}$ problems
Jan 23, 2015
answer
2
NP-hard problems on trees
Mar 17, 2016
Top network posts
View all network posts
41
Proof for the upper bound and lower bound for binomial coefficients.
8
What is the intuition behind the Potential Function in Amortized Analysis of some algorithm?

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.