Pages that link to "Item:Q1405785"
From MaRDI portal
The following pages link to A note on non-deterministic communication complexity with few witnesses (Q1405785):
Displaying 9 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Correction to: ``Communication complexity with small advantage'' (Q777910) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Optimal indecomposable witnesses without extremality or the spanning property (Q3165233) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)