AI Chat AI Image Generator AI Video Text to Speech

Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements

01/24/2019

∙

by Rei Mizuta, et al.

∙

∙

We consider about calculating Mth moments of a given polynomial in free independent semicircular elements in free probability theory. By a naive approach, this calculation requires exponential time with respect to M. We explicitly give an algorithm for calculating them in polynomial time by rearranging Schützenberger's algorithm.

page 1

page 2

page 3

page 4

research

∙ 01/30/2022

Polynomial-Time Approximation of Zero-Free Partition Functions

Zero-free based algorithm is a major technique for deterministic approxi...

0 Penghui Yao, et al. ∙

research

∙ 06/18/2019

Review of a Quantum Algorithm for Betti Numbers

We looked into the algorithm for calculating Betti numbers presented by ...

0 Sam Gunn, et al. ∙

research

∙ 04/16/2022

Polynomial-time sparse measure recovery

How to recover a probability measure with sparse support from particular...

0 Hadi Daneshmand, et al. ∙

research

∙ 03/27/2013

A Polynomial Time Algorithm for Finding Bayesian Probabilities from Marginal Constraints

A method of calculating probability values from a system of marginal con...

0 J. W. Miller, et al. ∙

research

∙ 02/11/2022

Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits

We are interested in computing k most preferred models of a given d-DNNF...

0 Pierre Bourhis, et al. ∙

research

∙ 09/12/2022

Polynomial time multiplication and normal forms in free band

We present efficient computational solutions to the problems of checking...

0 R. Cirpons, et al. ∙

research

∙ 09/05/2019

The distribution of Yule's 'nonsense correlation'

In 2017, the authors of ernst2017yule explicitly computed the second mom...

0 Philip A. Ernst, et al. ∙