Graph entropy and quantum sorting problems

DOI10.1145/1007352.1007377zbMATH Open1192.81109OpenAlexW2171349910WikidataQ130928252 ScholiaQ130928252MaRDI QIDQ3580995FDOQ3580995

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

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

Mathematics Subject Classification ID

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

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)