Nondeterministic Communication with a Limited Number of Advice Bits

DOI10.1137/S0097539702414622zbMath1040.68046OpenAlexW2093955013MaRDI QIDQ4441900

Juraj Hromkovič, Georg Schnitger

Publication date: 8 January 2004

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702414622

zbMATH Keywords

nondeterminismcommunication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Self-verifying Cellular Automata ⋮ Probabilism versus Alternation for Automata ⋮ Self-Verifying Pushdown and Queue Automata ⋮ Ambiguity and communication ⋮ Optimal simulation of self-verifying automata by deterministic automata ⋮ Iterative arrays with self-verifying communication cell ⋮ Converting Self-verifying Automata into Deterministic Automata

This page was built for publication: Nondeterministic Communication with a Limited Number of Advice Bits