Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (bibtex)
by S. Jeffery, R. Kothari, F. Le Gall and F. Magniez
Reference:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (S. Jeffery, R. Kothari, F. Le Gall and F. Magniez), In Algorithmica, volume 76, 2016.
Bibtex Entry:
@article{jkgm16,
	author = {S. Jeffery and R. Kothari and F. {Le Gall} and F. Magniez},
	doi = {10.1007/s00453-015-9985-x},
	journal = {Algorithmica},
	number = {1},
	pages = {1-16},
	pdf = {./PAPIERS/jklm-algorithmica16.pdf},
	title = {Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision},
	volume = {76},
	year = {2016},
	bdsk-url-1 = {https://doi.org/10.1007/s00453-015-9985-x},
	bdsk-url-2 = {./PAPIERS/jklm-algorithmica16.pdf}}
Powered by bibtexbrowser