Combinatorial Bernoulli Factories with Polynomially Many Coins
cs.DS, cs.GT, cs.LG, math.PR, stat.CO
Submitted: 2026-11-12
Updated: 2026-11-12
Code: https://github.com/radniazadeh/bernoulli-poly
Terminology
Sources
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time