Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021
DOI: 10.1137/1.9781611976465.60
|View full text |Cite
|
Sign up to set email alerts
|

Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles