Graph entropy and quantum sorting problems

DOI10.1145/1007352.1007377zbMath1192.81109OpenAlexW2171349910MaRDI QIDQ3580995

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

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

Related Items (1)

Sorting under partial information (without the ellipsoid algorithm).

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