scientific article; zbMATH DE number 1256774

From MaRDI portal

Revision as of 15:08, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4228510

Jump to:navigation, search

zbMath0922.68060MaRDI QIDQ4228510

Juraj Hromkovič, Georg Schnitger

Publication date: 4 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

nondeterministic communication complexity

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (5)

Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ Size complexity of rotating and sweeping automata ⋮ On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata ⋮ Communication complexity method for measuring nondeterminism in finite automata

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4228510&oldid=18102906"

Pages with script errors