"Polynomial degree vs. quantum query complexity."

Andris Ambainis (2006)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2005.06.006

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Ambainis06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Ambainis06
Andris Ambainis:
Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2): 220-238 (2006)

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.