Now showing items 1-1 of 1

    • Quantum query complexity in computational geometry revisited 

      BAHADUR, A; DURR, C; LAFAYE, T; KULKARNI, R (SPIE-INT SOC OPTICAL ENGINEERING, 2006)
      We are interested in finding quantum algorithms for problems in the area of computation geometry. Many of the problems we study have already polynomial time algorithms. But since in this area the input sizes are huge,, ...