Now showing items 1-1 of 1

    • Some Upper and Lower Bounds regarding Query Complexity 

      Liu, Rui Peng (University of Waterloo, 2017-08-29)
      Query complexity is one of the several notions of complexity de ned to measure the cost of algorithms. It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages