English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present real, complex, and quaternionic versions of a simple ran-domized polynomial time algorithm to approximate the permanent of a non-negative matrix and, more generally, the mixed discriminant of positive semideenite 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. Random Structures & Algorithms, to appear.

Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor