scientific article; zbMATH DE number 1500514

zbMath0959.68522MaRDI QIDQ4501529

Juraj Hromkovič, Martin Sauerhoff

Publication date: 26 April 2001

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

zbMATH Keywords

multipartition protocols

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs ⋮ On multi-partition communication complexity ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ Approximation of boolean functions by combinatorial rectangles ⋮ Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. ⋮ On the power of randomized multicounter machines ⋮ Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication ⋮ Width hierarchy for \(k\)-OBDD of small width

This page was built for publication: