Kolmogorov complexity and combinatorial methods in communication complexity (Q534568): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2010.10.044 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Exponential Separation of Quantum and Classical One-Way Communication Complexity / 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: A strong direct product theorem for corruption and the multiparty communication complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of the incompressibility method. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Individual communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications of information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized one-round communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjointness is hard in the multiparty number-on-the-forehead model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in communication complexity based on factorization norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier analysis for probabilistic communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication complexity of symmetric predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735043 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2010.10.044 / rank
 
Normal rank

Latest revision as of 20:49, 9 December 2024

scientific article
Language Label Description Also known as
English
Kolmogorov complexity and combinatorial methods in communication complexity
scientific article

    Statements

    Kolmogorov complexity and combinatorial methods in communication complexity (English)
    0 references
    0 references
    0 references
    18 May 2011
    0 references
    communication complexity
    0 references
    Kolmogorov complexity
    0 references
    information theory
    0 references

    Identifiers