Tag: communication-complexity

Found 59 results for 'communication-complexity'.

1) cc.complexity-theory - Communication complexity of Independent Set game?
2) cc.complexity-theory - Communication Complexity ...Classes?
3) cc.complexity-theory - A direct-sum theorem for the non-deterministic communication complexity of inequality?
4) communication-complexity - One way communication complexity of multi exact matching
5) cc.complexity-theory - multi-party Communication complexity of "Set Partition problem"
6) it.information-theory - Expected vs worst-case communication complexity
7) lower-bounds - Lower bounds on alternative models of multiparty communication complexity
8) cc.complexity-theory - Delegating all of the work to the prover in $\mathcal{MA}$ protocols
9) ds.algorithms - Bounds on approximating frequency moments
10) cc.complexity-theory - Why does deterministic recognition of DYCK(2) languages in the streaming model take linear space?
11) it.information-theory - Why not include private randomness in internal communication information definition?
12) cc.complexity-theory - A balanced generalization of Hall’s theorem
13) quantum-computing - Are Alice and Bob allowed to copy qubits in quantum communication complexity model?
14) co.combinatorics - Monochromatic Rectangle Tiling
15) cc.complexity-theory - Nondeterministic communication complexity of set disjointness?
16) communication-complexity - One-way randomized communication complexity of approximate Hamming distance
17) communication-complexity - Gap-Hamming with different "threshold" (i.e., not $n/2$)
18) communication-complexity - Combination of Disjointness and Gap Hamming Distance communication complexity
19) randomness - Newman's lemma for distributional communication complexity
20) cr.crypto-security - Existence of zero-knowledge proof for location
21) communication-complexity - Minimum communication cost for zero knowledge proofs of three colorability
22) reference-request - Is there a name for this concept in Communication Complexity?
23) fl.formal-languages - Lower bound for NFA accepting 3 letter language
24) cc.complexity-theory - Communication lower bounds for partial boolean functions
25) lower-bounds - Best communication complexity lower bound of disjointness
26) lower-bounds - Deterministic communication complexity vs partition number
27) fl.formal-languages - Protocol partition number and deterministic communication complexity
28) boolean-functions - Real representation versus communication complexity
29) communication-complexity - Effect of protocol ordering on multiparty comm. complexity
30) cc.complexity-theory - One way randomised communication complexity of disjointness
31) reference-request - Communication complexity of reconstructing a random bit-string of length $n$
32) cc.complexity-theory - Communication complexity for deciding associativity
33) cc.complexity-theory - Lower bounds for Nondeterministic Multiparty Communication
34) communication-complexity - Zero error randomized communication complexity vs deterministic communication complexity
35) reference-request - Communication complexity of approximating the size of set intersection
36) cc.complexity-theory - Stronger Lower Bounds on Nondeterministic Multiparty Communication
37) reference-request - One-way randomized communication complexity of Greater-Than
38) cc.complexity-theory - Communication complexity with a referee
39) quantum-information - Any evidence that Linial, Shraibman lower bound on quantum communication complexity is not tight?
40) dc.distributed-comp - Average message complexity for the election problem on graphs
41) cc.complexity-theory - The relationship between QCMA and QMA in the Turing and Communication model
42) lg.learning - Approximating the sign rank of a matrix
43) cc.complexity-theory - Best sources for communication complexity
44) cc.complexity-theory - Why does the log-rank conjecture use rank over the reals?
45) lower-bounds - Is it possible to prove stronger bounds for the deterministic communication complexity compared to nondeterministic communication complexity?
46) cc.complexity-theory - Binary rank of binary matrix
47) communication-complexity - Testing for positivity instead of equality
48) randomized-algorithms - Deterministic communication complexity of refinement
49) communication-complexity - On the notion of positive rank of a matrix
50) reference-request - Estimating inner product over $[r]^d$