Theoretical Computer Science
jian
  • Member for 11 years, 5 months
  • Last seen more than 5 years ago
Profile Activity
Stats
757
reputation
3k
reached
0
answers
10
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
9
bronze badges
Top tags
View all tags
0
Score
8
Posts
80
Posts %
0
Score
3
Posts
30
Posts %
0
Score
2
Posts
20
Posts %
0
Score
2
Posts
20
Posts %
0
Score
1
Posts
10
Posts %
0
Score
1
Posts
10
Posts %
Top posts
All Questions Answers
Votes Newest
11
min hitting set of every base of a matroid
May 19 '12
11
maximize MST(G[S]) over all induced subgraphs G[S] in a metric graph
Aug 5 '13
8
FPRAS for #P-complete problems
Oct 8 '11
7
Is there any known result for 1-median problem with negative weights in Euclidean space?
Feb 23 '14
6
Tree rotation, a problem similar to Huffman coding
Mar 2 '12
6
Self-intersecting walk in expander graphs
Nov 11 '11
6
Find the maximum set whose subset sum is unique for every of its subset
Dec 30 '11
5
Exact version of matroid, given the input weight is in unary.
Dec 2 '10
3
Is there any result on approximating an arbitrary tree metric by an HST metric?
Jan 7 '12
2
Is there a way to solve or approximate the concave program with separable objective?
Nov 16 '11
Top network posts
View all network posts
12
The metric of the expected difference of random variables
8
is there any such result about Bernstein polynomials?

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.