Author:
Iriyama Satoshi,Ohya Masanori
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Levin, L.A.: Universal sequential search problems. Probl. Inf. Transm. 9(3), 265–266 (1973)
2. Levin, L.A.: Randomness conservation inequalities: information and independence in mathematical theories. Inf. Control 61, 15–37 (1984)
3. Solomonoff, R.J.: Optimum sequential search. Memorandum, Oxbridge Research, Cambridge (1984)
4. Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science. IEEE Press, Los Alamitos (1994)
5. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, p. 212 (1996)