"A Better Lower Bound for Quantum Algorithms Searching an Ordered List."

Andris Ambainis (1999)

> Home

Details and statistics

DOI: 10.1109/SFFCS.1999.814606

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/Ambainis99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/Ambainis99
Andris Ambainis:
A Better Lower Bound for Quantum Algorithms Searching an Ordered List. FOCS 1999: 352-357

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.