Pages that link to "Item:Q1182120"
From MaRDI portal
The following pages link to Private vs. common random bits in communication complexity (Q1182120):
Displaying 50 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Growth and structure of the World Wide Web: Towards realistic modeling (Q696668) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- A characterization of average case communication complexity (Q845939) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- On Slepian-Wolf theorem with interaction (Q1635810) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Logarithmic Sobolev inequality for lattice gases mixing conditions (Q1925003) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- On public-coin zero-error randomized communication complexity (Q2169433) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs (Q2685613) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- New strong direct product results in communication complexity (Q2796407) (← links)
- Upper and lower bounds on the power of advice (Q2816830) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Equality, Revisited (Q2946382) (← links)
- Common Randomness and Secret Key Capacities of Two-Way Channels (Q3002104) (← links)
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Making Randomness Public in Unbounded-Round Information Complexity (Q3194724) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
