Math 2.0

Resources / preprint

Wyner's Common Information and the Common Entropy are NP-Hard to Compute WSE8SEHVXG

URIm2://res/WSE8SEHVXG
Kindpreprint
CreatorsRoberto Bruno, Ugo Vaccaro
Date2026-10-11
Subjectsarxiv cs.IT, arxiv math.IT
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-11
IdsarXiv 2610.15402

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Hardness of the common entropystatementtheorem 3arxiv
1YKFKS6QTJstatementtheorem 24arxiv
1ZVMRXV0XMstatementlemma 23arxiv
3Z9TEW7CPGstatementlemma 7arxiv
44PFVJN9ZWdefinitiondefinition 15arxiv
Hardness of approximating the common entropystatementcorollary 26arxiv
9B36VQ28PGstatementtheorem 13arxiv
9YNZXBJCWPstatementlemma 10arxiv
DW8QJ2BEHNstatementlemma 5arxiv
G5Q7CM905Wstatementlemma 19arxiv
Hardness of Wyner's common informationstatementtheorem 1arxiv
GFYTW6EMNZstatementlemma 20arxiv
HXF6Z9YBXHdefinitiondefinitionarxiv
NF8R7B1QWKdefinitiondefinition 6arxiv
NW51ZA5EYGstatementlemma 18arxiv
PBC56CHD11statementlemma 21arxiv
PNNHZYH14Sdefinitiondefinition 4arxiv
QDYEMP3RD2statementlemma 22arxiv
QGZ2KD32DAdefinitiondefinition 16arxiv
S1RHGQQXQQstatementproposition 12arxiv
Moore and Robsonstatementtheorem 17arxiv
TP2Y7MBW9Ddefinitiondefinition 2arxiv
V56W50P1NSstatementlemma 8arxiv
W9NSCMH4Z8statementproposition 27arxiv
ZWRMYRA7N5statementcorollary 9arxiv

Catalogue records