Pages that link to "Item:Q4265538"
From MaRDI portal
The following pages link to Communication Complexity and Lower Bounds on Multilective Computations (Q4265538):
Displaying 17 items.
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- Lower bounds on the multiparty communication complexity (Q1267715) (← links)
- The communication complexity of computing differentiable functions in a multicomputer network (Q1318701) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- On the power of multiple reads in a chip (Q2366566) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- The communication complexity of interleaved group products (Q2941525) (← links)
- (Q2965522) (← links)
- Languages with Bounded Multiparty Communication Complexity (Q3590958) (← links)
- (Q4016535) (← links)
- (Q4550982) (← links)
- Automata, Languages and Programming (Q5716863) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)
- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems (Q5756728) (← links)