Quantum time-space tradeoffs for sorting
From MaRDI portal
Publication:3581266
DOI10.1145/780542.780553zbMath1192.81083OpenAlexW2047235049MaRDI QIDQ3581266
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780553
Related Items
Time-Space Complexity Advantages for Quantum Computing ⋮ Lifting query complexity to time-space complexity for two-way finite automata