scientific article; zbMATH DE number 2102760

zbMath1046.68531MaRDI QIDQ4818848

Farid M. Ablayev, Marek Karpinski

Publication date: 24 September 2004

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (13)

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 the Complexity of the Hidden Weighted Bit Function for Various BDD Models ⋮ Nondeterministic unitary OBDDs ⋮ Randomization and nondeterminism are comparable for ordered read-once branching programs ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ Randomized OBDDs for the most significant bit of multiplication need exponential space ⋮ A lower bound for integer multiplication on randomized ordered read-once branching programs. ⋮ New size hierarchies for two way automata ⋮ On BPP versus \(NP\cup coNP\) for ordered read-once branching programs ⋮ Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size ⋮ On the computational power of probabilistic and quantum branching program

This page was built for publication: