Sciweavers

2 search results - page 1 / 1
» A Deterministic Strongly Polynomial Algorithm for Matrix Sca...
Sort
View
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
13 years 9 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 6 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan