Nondeterministic Communication with a Limited Number of Advice Bits
From MaRDI portal
Recommendations
Cited in
(15)- A note on non-deterministic communication complexity with few witnesses
- On the power of laconic advice in communication complexity
- Nondeterministic separations
- On the Non-deterministic Communication Complexity of Regular Languages
- On the non-deterministic communication complexity of regular languages
- Converting Self-verifying Automata into Deterministic Automata
- scientific article; zbMATH DE number 1256774 (Why is no real title available?)
- scientific article; zbMATH DE number 1335889 (Why is no real title available?)
- Self-verifying pushdown and queue automata
- Ambiguity and communication
- Optimal simulation of self-verifying automata by deterministic automata
- A little advice can be very helpful
- Self-verifying Cellular Automata
- Probabilism versus Alternation for Automata
- Iterative arrays with self-verifying communication cell
This page was built for publication: Nondeterministic Communication with a Limited Number of Advice Bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441900)