Communication Complexity and Quasi Randomness
From MaRDI portal
(Redirected from Publication:5285941)
Recommendations
Cited in
(24)- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Non-deterministic communication complexity with few witnesses
- Hypergraphs, quasi-randomness, and conditions for regularity
- Some applications of hypercontractive inequalities in quantum information theory
- Hellinger volume and number-on-the-forehead communication complexity
- Communication and Randomness Lower Bounds for Secure Computation
- Quasi-random hypergraphs revisited
- The Communication Complexity of Non-signaling Distributions
- Average and randomized communication complexity
- Hadamard tensors and lower bounds on multiparty communication complexity
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Quasi‐random classes of hypergraphs
- On a theorem of Razborov
- Communication complexity of key agreement on small ranges
- Interleaved Group Products
- The NOF multiparty communication complexity of composed functions
- Simultaneous multiparty communication protocols for composed functions
- Pseudorandom functions: three decades later
- The communication complexity of addition
- One-way multiparty communication lower bound for pointer jumping with applications
- Automata, Languages and Programming
- Quasi-random Boolean functions
- Distributional PAC-learning from Nisan's natural proofs
- Agnostic membership query learning with nontrivial savings: new results and techniques
This page was built for publication: Communication Complexity and Quasi Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285941)
