scientific article; zbMATH DE number 5485519

MaRDI QIDQ3549688zbMATH OpenFDO

Authors Alexander A. Sherstov

Publication date 5 January 2009

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Cited in

(7)

• The NOF multiparty communication complexity of composed functions
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
• The complexity of quantum disjointness
• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
• One-way multiparty communication lower bound for pointer jumping with applications
• The power of asymmetry in constant-depth circuits

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549688)