On Slepian-Wolf theorem with interaction (Q1635810): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568827018 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.00617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Compression of Protocols to Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public vs Private Coin in Bounded-Round Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a reverse Newman's theorem in interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noiseless coding of correlated information sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499280 / rank
 
Normal rank

Latest revision as of 18:57, 15 July 2024

scientific article
Language Label Description Also known as
English
On Slepian-Wolf theorem with interaction
scientific article

    Statements

    On Slepian-Wolf theorem with interaction (English)
    0 references
    1 June 2018
    0 references
    Slepian-Wolf theorem
    0 references
    communication complexity
    0 references
    information complexity
    0 references
    interactive compression
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references