the archive
#complexity analysis
2 resultsstat.CO2019
Multilevel Optimal Transport: a Fast Approximation of Wasserstein-1 distances
Jialin Liu, Wotao Yin, Wuchen Li +1
The paper introduces a multilevel primal‑dual algorithm that rapidly approximates the Wasserstein‑1 distance, achieving solutions for 512×512 images in under a few seconds on a sin…
#wasserstein-1 distance#multilevel methods#primal-dual algorithm#fast computation
cs.SC2019
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module
Yossef Musleh, Ãric Schost
The paper presents one deterministic and two Monte Carlo algorithms for computing the characteristic polynomial of a rank‑two Drinfeld module, analyzes their asymptotic complexity,…
#drinfeld modules#characteristic polynomial#algorithm design#deterministic algorithms