scientific article
From MaRDI portal
Publication:3549688
zbMath1231.68145MaRDI QIDQ3549688
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (8)
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ The Power of Asymmetry in Constant-Depth Circuits ⋮ A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length ⋮ The NOF multiparty communication complexity of composed functions ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ Sensitivity, affine transforms and quantum communication complexity ⋮ The complexity of quantum disjointness
This page was built for publication: