scientific article; zbMATH DE number 5485520

MaRDI QIDQ3549689zbMATH OpenFDO

Authors Dmitry Gavinsky

Publication date 5 January 2009

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(5)

• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
• Quantum weakly nondeterministic communication complexity
• Non-uniformity and quantum advice in the quantum random oracle model
• Classical vs quantum advice and proofs under classically-accessible oracle
• Quantum communication complexity of classical auctions

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 Q3549689)