Pages that link to "Item:Q5203681"
From MaRDI portal
The following pages link to Communication complexity: A survey (Q5203681):
Displaying 40 items.
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Clique versus independent set (Q402465) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- The advantages of a new approach to defining the communication complexity for VLSI (Q1106661) (← links)
- Private vs. common random bits in communication complexity (Q1182120) (← links)
- Communication complexity of two decision problems (Q1201105) (← links)
- Network mechanisms, informational efficiency, and hierarchies (Q1268596) (← links)
- A three-party communication problem (Q1278045) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Communication complexity in lattices (Q1324492) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- A comparison of two lower-bound methods for communication complexity (Q1350995) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- A note on non-deterministic communication complexity with few witnesses (Q1405785) (← links)
- Recognition problems and communication complexity. (Q1422409) (← links)
- The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
- Matrices generated by semilattices (Q1804881) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Fourier analysis for probabilistic communication complexity (Q1918947) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Multipartite quantum correlation and communication complexities (Q2012182) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Rounds in Communication Complexity Revisited (Q4037694) (← links)
- Lower bounds for one-way probabilistic communication complexity (Q4630264) (← links)
- A comparison of two lower bound methods for communication complexity (Q5096890) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- On the complexity of communication complexity (Q5172741) (← links)
- Communication Complexity (Q5213788) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- The advantages of a new approach to defining the communication complexity for VLSI (Q5966473) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- The communication complexity of pointer chasing: applications of entropy and sampling (Q6483601) (← links)
