Towards a reverse Newman's theorem in interactive information complexity (Q343858): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/algorithmica/BrodyBKLSV16, #quickstatements; #temporary_batch_1731468600454
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: How to compress interactive 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: Public vs Private Coin in Bounded-Round Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Compression of Protocols to Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Product via Round-Preserving Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Noisy Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct product theorem for two-party bounded-round public-coin communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449184 / 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: Simple and Tight Bounds for Information Reconciliation and Privacy Amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noiseless coding of correlated information sources / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/BrodyBKLSV16 / rank
 
Normal rank

Latest revision as of 04:31, 13 November 2024

scientific article
Language Label Description Also known as
English
Towards a reverse Newman's theorem in interactive information complexity
scientific article

    Statements

    Towards a reverse Newman's theorem in interactive information complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    communication complexity
    0 references
    information complexity
    0 references
    information theory
    0 references
    compression
    0 references
    Slepian-Wolf
    0 references

    Identifiers