A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Nathan Linial Hebrew University
Alex Samorodnitsky Hebrew University
Avi Wigderson Hebrew University
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pages 644-652
ACM New York, NY, USA ©1998
table of contents ISBN:0-89791-962-9 doi>10.1145/276698.276880
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Published by ACM 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 20
· Downloads (cumulative): 360
· Citation Count: 12


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder