1. M. Boyer, G. Brassard, P. Hoyer, A. Tapp, Tight bounds on quantum searching, in: T. Toffoli, et al. (Eds.), Proceedings of the Workshop on Physics and Computation (PhysComp96), New England Complex Systems Institute, Cambridge, MA, 1996, pp. 36–43
2. G. Brassard, P. Hoyer, A. Tapp, Quantum counting. in: K. Larsen (Ed.), Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP98), Springer, Berlin, 1998, pp. 820–831. Los Alamos preprint quant-ph/9805082
3. N.J. Cerf, L.K. Grover, C.P. Williams, Nested quantum search and NP-complete problems, in: Applicable Algebra in Engineering, Communication and Computing, Springer, Berlin, 1998. Los Alamos preprint quant-ph/9806078
4. Quantum computers and intractable (NP-complete) computing problems;Cerny;Phys. Rev. A,1993
5. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: J. Mylopoulos, R. Reiter (Eds.), Proceedings of IJCAI91, Morgan Kaufmann, San Mateo, CA, 1991, pp. 331–337