"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using ..."

Stacey Jeffery et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S00453-015-9985-X

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/JefferyKGM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/JefferyKGM16
Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica 76(1): 1-16 (2016)

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.