Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57349768, #quickstatements; #temporary_batch_1710970253704 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new class of non-Shannon-type inequalities for entropies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial interpretation of Kolmogorov complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial approach to information inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On characterization of entropy function via information inequalities / rank | |||
Normal rank | |||
Latest revision as of 10:55, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning multi-dimensional sets in a small number of ``uniform'' parts |
scientific article |
Statements
Partitioning multi-dimensional sets in a small number of ``uniform'' parts (English)
0 references
7 December 2006
0 references
bipartite graphs
0 references
information inequalities for Shannon entropy
0 references
