scientific article; zbMATH DE number 5485519

zbMATH Open1231.68145MaRDI QIDQ3549688FDOQ3549688

Authors: Alexander A. Sherstov 

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

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

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)