"How Low Can Approximate Degree and Quantum Query Complexity Be for Total ..."

Andris Ambainis, Ronald de Wolf (2013)

> Home

Details and statistics

DOI: 10.1109/CCC.2013.26

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/coco/AmbainisW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/AmbainisW13
Andris Ambainis, Ronald de Wolf:
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? CCC 2013: 179-184

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.