A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

被引：76
|
作者：
Linial, N [1 ]
Samorodnitsky, A
Wigderson, A
机构：
[1] Hebrew Univ Jerusalem, Sch Engn & Comp Sci, IL-91904 Jerusalem, Israel
[2] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA
[3] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA
来源：
COMBINATORICA | 2000年 / 20卷 / 04期
关键词：
D O I：
10.1007/s004930070007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present a deterministic strongly polynomial algorithm that computes the permanent of a, nonnegative nxn matrix to within a multiplicative factor of e(n). 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 simple new (slow) polynomial time decision algorithm for bipartite perfect matching, conceptually different from classical approaches.
引用
收藏
页码：545 / 568
页数：24
相关论文
共 50 条
  • [1] A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
    Nathan Linial
    Alex Samorodnitsky
    Avi Wigderson
    Combinatorica, 2000, 20 : 545 - 568
  • [2] A deterministic algorithm for inverting a polynomial matrix
    Zhou, Wei
    Labahn, George
    Storjohann, Arne
    JOURNAL OF COMPLEXITY, 2015, 31 (02) : 162 - 173
  • [3] A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time
    Pierre Lairez
    Foundations of Computational Mathematics, 2017, 17 : 1265 - 1292
  • [4] A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time
    Lairez, Pierre
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2017, 17 (05) : 1265 - 1292
  • [5] A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning
    Diakonikolas, Ilias
    Tzamos, Christos
    Kane, Daniel M.
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1741 - 1754
  • [6] Strongly Polynomial Frame Scaling to High Precision
    Dadush, Daniel
    Ramachandran, Akshay
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 962 - 981
  • [7] FPGA-Based Design and Implementation of an Approximate Polynomial Matrix EVD Algorithm
    Kasap, Server
    Redif, Soydan
    2012 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT'12), 2012, : 135 - 140
  • [8] AN APPROXIMATE POLYNOMIAL MATRIX EIGENVALUE DECOMPOSITION ALGORITHM FOR PARA-HERMITIAN MATRICES
    Redif, Soydan
    Weiss, Stephan
    McWhirter, John G.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), 2011, : 421 - 425
  • [9] FPGA-based design and implementation of an approximate polynomial matrix EVD algorithm
    Department of Electrical and Electronics Engineering, European University of Lefke, Gemikonagi, Lefke, Cyprus
    FPT - Int. Conf. Field-Programmable Technol., (135-140):
  • [10] Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor
    Barvinok, A
    RANDOM STRUCTURES & ALGORITHMS, 1999, 14 (01) : 29 - 61
12345