A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

DOI10.46298/theoretics.23.7MaRDI QIDQ6566594

Could not fetch data.

Publication date: 3 July 2024

Published in: TheoretiCS (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmtotal variation distanceproduct distribution

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
• Approximate counting by dynamic programming
• An FPTAS for #Knapsack and Related Counting Problems

This page was built for publication: A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566594)