scientific article; zbMATH DE number 1335889
From MaRDI portal
Publication:4258580
zbMath0935.68027MaRDI QIDQ4258580
Publication date: 13 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Lower Bounds for the Size of Nondeterministic Circuits ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. ⋮ The communication complexity of pointer chasing ⋮ Communication complexity method for measuring nondeterminism in finite automata
