A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Mark Jerrum University of Edinburgh, Edinburgh, United Kingdom
Alistair Sinclair University of California at Berkeley, Berkeley, California
Eric Vigoda University of Chicago, Chicago, Illinois
Published in:
Cover Image
 
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 51 Issue 4, July 2004
Pages 671-697
ACM New York, NY, USA
table of contents doi>10.1145/1008731.1008738
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 122
· Downloads (cumulative): 1,772
· Citation Count: 58


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