"Quantum and Classical Query Complexities of Local Search Are Polynomially ..."

Miklos Santha, Mario Szegedy (2009)

> Home

Details and statistics

DOI: 10.1007/S00453-008-9169-Z

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SanthaS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SanthaS09
Miklos Santha, Mario Szegedy:
Quantum and Classical Query Complexities of Local Search Are Polynomially Related. Algorithmica 55(3): 557-575 (2009)

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.