产品分布的总变异距离为# p -完全

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2025-01-21 DOI:10.1016/j.ipl.2025.106560

Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N.V. Vinodchandran

引用次数: 0

摘要

我们证明计算两个产品分布之间的总变异距离是# p -完备的。这与其他距离度量（如Kullback-Leibler、Chi-square和Hellinger）形成鲜明对比，后者在边缘上张紧，从而产生高效的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Total variation distance for product distributions is #P-complete

We show that computing the total variation distance between two product distributions is

# P

-complete. This is in stark contrast with other distance measures such as Kullback–Leibler, Chi-square, and Hellinger, which tensorize over the marginals leading to efficient algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.