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 the first strongly polynomial time algorithm for matrix scaling - an important nonlinear optimization problem with many applications. Our work suggests a (slow) decision algorithm for bipartite perfect matching, conceptually different from known approaches.
|Number of pages
|Conference Proceedings of the Annual ACM Symposium on Theory of Computing
|Published - 1998
|Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 1998 → 26 May 1998