scientific article; zbMATH DE number 1857650
From MaRDI portal
Publication:4788609
zbMath1056.68087MaRDI QIDQ4788609
Publication date: 2 June 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)
Related Items (6)
On multi-partition communication complexity ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ On the power of randomized multicounter machines ⋮ On probabilistic pushdown automata ⋮ Communication complexity method for measuring nondeterminism in finite automata
This page was built for publication:
