Recommendations
- The communication complexity of addition
- Communication complexity of some number theoretic functions
- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
- One-round multi-party communication complexity of distinguishing sums
- Separating deterministic from randomized multiparty communication complexity
Cites work
- scientific article; zbMATH DE number 1689047 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 1142303 (Why is no real title available?)
- scientific article; zbMATH DE number 3353257 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
- Communication Complexity
- Communication Complexity and Quasi Randomness
- Computing with Noisy Information
- Constant depth circuits, Fourier transform, and learnability
- Estimating the optimal margins of embeddings in Euclidean half spaces
- Hardness Amplification Proofs Require Majority
- Learning and lower bounds for AC\(^{0}\) with threshold gates
- Learning complexity vs communication complexity
- Logarithmic forms and Diophantine geometry
- Majority gates vs. general weighted threshold gates
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Natural proofs
- Norms, XOR lemmas, and lower bounds for polynomials and protocols
- Number-theoretic constructions of efficient pseudo-random functions
- On data structures and asymmetric communication complexity
- On the Size of Weights for Threshold Gates
- On the complexity of information spreading in dynamic networks
- On the power of small-depth threshold circuits
- One way functions and pseudorandom generators
- Parity, circuits, and the polynomial-time hierarchy
- Perceptrons of large weight
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
- Pseudorandom Functions and Factoring
- Pseudorandom bits for polynomials
- Randomness is linear in space
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Synthesizers and their application to the parallel construction of pseudo-random functions
- The BNS-Chung criterion for multi-party communication complexity
- The expressive power of voting polynomials
- Theory of majority decision elements
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
Cited in
(12)- One-round multi-party communication complexity of distinguishing sums
- The cost of the missing bit: Communication complexity with help
- Dimension-free bounds and structural results in communication complexity
- The communication complexity of functions with large outputs
- Rectangles are nonnegative juntas
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Exponential separation of communication and external information
- Arithmetic sketching
- Simplified separation of information and communication
- The communication complexity of addition
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Communication complexity of some number theoretic functions
This page was built for publication: The communication complexity of addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519955)
