Bounds on tradeoffs between randomness and communication complexity (Q687507): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials using fewer random bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness in interactive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing, merging, and sorting on parallel models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on tradeoffs between randomness and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / 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: Probabilistic communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Randomness Trade-Off for Oblivious Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scheme for Fast Parallel Communication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01200118 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132015189 / rank
 
Normal rank

Latest revision as of 08:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Bounds on tradeoffs between randomness and communication complexity
scientific article

    Statements

    Bounds on tradeoffs between randomness and communication complexity (English)
    0 references
    0 references
    0 references
    18 October 1993
    0 references
    The authors analyze the amount of randomness used in randomized protocols for computing a binary function \(f\), the input of which being split between two parties. For various models of communication complexity, they prove tight lower bounds depending on the number of bits communicated and the deterministic communication complexity of \(f\). The proof techniques are mainly combinatorial in nature.
    0 references
    randomized protocols
    0 references
    binary function
    0 references
    communication complexity
    0 references
    lower bounds
    0 references

    Identifiers