Graph entropy and quantum sorting problems

DOI10.1145/1007352.1007377MaRDI QIDQ3580995zbMATH OpenOpenAlexWikidataFDO

Authors Andrew Chi-Chih Yao

Publication date 15 August 2010

Published in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1007352.1007377

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Entropy and sorting.
• Entropy lower bounds for quantum decision tree complexity
• Quantum complexities of ordered searching, sorting, and element distinctness
• scientific article; zbMATH DE number 1756014

Cited in

(1)

• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: Graph entropy and quantum sorting problems

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