Deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 644-652

  Linial, Nathan ^a   Samorodnitsky, Alex ^a   Wigderson, Avi ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

BIPARTITE PERFECT MATCHING; DETERMINISTIC STRONGLY POLYNOMIAL ALGORITHMS;

ALGORITHMS;

EID: 0031619018     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)