Open AccessQuantum time-space tradeoffs for sorting
Author(s) -
Hartmut Klauck
Publication year - 2003
Language(s) - Uncategorized
Resource type - Conference proceedings
DOI - 10.1145/780551.780553
Subject(s) - sorting , upper and lower bounds , binary logarithm , time complexity , sorting algorithm , bounded function , combinatorics , quantum , omega , discrete mathematics , mathematics , quantum algorithm , sorting network , space (punctuation) , log log plot , quantum computer , algorithm , computer science , physics , quantum mechanics , mathematical analysis , operating system
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom