Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor This research was partially supported by Alfred P. Sloan Research Fellowship, by NSF Grants DMS 9501129 and DMS 9734138, and by the Mathematical Sciences Research Institute, Berkeley, CA through NSF Grant DMS 9022140.
dc.contributor.author | Barvinok, Alexander I. | en_US |
dc.date.accessioned | 2006-04-19T14:10:07Z | |
dc.date.available | 2006-04-19T14:10:07Z | |
dc.date.issued | 1999-01 | en_US |
dc.identifier.citation | Barvinok, Alexander (1999)."Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor This research was partially supported by Alfred P. Sloan Research Fellowship, by NSF Grants DMS 9501129 and DMS 9734138, and by the Mathematical Sciences Research Institute, Berkeley, CA through NSF Grant DMS 9022140. ." Random Structures and Algorithms 14(1): 29-61. <http://hdl.handle.net/2027.42/35110> | en_US |
dc.identifier.issn | 1042-9832 | en_US |
dc.identifier.issn | 1098-2418 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/35110 | |
dc.description.abstract | We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant of positive semidefinite matrices. The algorithm provides an unbiased estimator, which, with high probability, approximates the true value within a factor of O ( c n ), where n is the size of the matrix (matrices) and where c ≈ 0.28 for the real version, c ≈ 0.56 for the complex version, and c ≈ 0.76 for the quaternionic version. We discuss possible extensions of our method as well as applications of mixed discriminants to problems of combinatorial counting. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 29–61, 1999 | en_US |
dc.format.extent | 319626 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | John Wiley & Sons, Inc. | en_US |
dc.subject.other | Mathematics and Statistics | en_US |
dc.title | Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor This research was partially supported by Alfred P. Sloan Research Fellowship, by NSF Grants DMS 9501129 and DMS 9734138, and by the Mathematical Sciences Research Institute, Berkeley, CA through NSF Grant DMS 9022140. | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1109 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/35110/1/2_ftp.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1002/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X | en_US |
dc.identifier.source | Random Structures and Algorithms | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.