Pages that link to "Item:Q1337464"
From MaRDI portal
The following pages link to Non-deterministic communication complexity with few witnesses (Q1337464):
Displaying 12 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- The cost of the missing bit: Communication complexity with help (Q700359) (← links)
- A note on non-deterministic communication complexity with few witnesses (Q1405785) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Nondeterministic communication complexity with help and graph functions (Q2420638) (← 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)
- (Q5158502) (← links)