6 reputation
3
bio website
location
age
visits member for 2 years
seen Dec 1 '12 at 6:11

Oct
22
comment Finding an $O(n \log n)$ time algorithm for an optimization problem
Summation xi >=1 ???
Oct
22
comment using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
@KevinCarlson ...I also think there is an O(nlogn) algorithm for the problem.But again can't figure out how ...
Oct
22
comment Finding an $O(n \log n)$ time algorithm for an optimization problem
Whenever I take n/2 elements of x, they sum to at least 1...I hope things become clearer now?
Oct
22
comment using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
yeah...right...xi's are elements of x.So x1,x2...xn/2
Oct
22
comment using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
also S is a subset of [n] not belongs to...[n] represents the set of n linearly independent columns
Oct
22
comment using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
yeah thanks for the editing.S are just the set of indices
Oct
22
awarded  Commentator
Oct
22
comment Finding an $O(n \log n)$ time algorithm for an optimization problem
The minimum is taken over all c(transpose)*x and x in this case is {x1,x2,x3...,xi} for i taken from S...Is it clear now?
Oct
22
comment Finding an $O(n \log n)$ time algorithm for an optimization problem
S are just the set of indices
Oct
22
comment Finding an $O(n \log n)$ time algorithm for an optimization problem
see I dont know how to write this out...a) summation xi>=1 for i belongs to S ... b)S belongs to [n] with |S|=n/2 I was thinking of the number of steps in the problem ...for this it is (n choose (n/2)) and then in some way decrease the number of steps...
Oct
22
revised using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
added 9 characters in body
Oct
22
awarded  Editor
Oct
22
revised Finding an $O(n \log n)$ time algorithm for an optimization problem
added 9 characters in body
Oct
22
asked Finding an $O(n \log n)$ time algorithm for an optimization problem
Oct
22
asked using the ellipsoid algorithm to find a poly time algorithm for the optimization problem
Oct
20
awarded  Student