Improving quantum query complexity of boolean matrix multiplication using graph collision (bibtex)
by S. Jeffery, R. Kothari and F. Magniez
Reference:
Improving quantum query complexity of boolean matrix multiplication using graph collision (S. Jeffery, R. Kothari and F. Magniez), In Proceedings of 39th International Colloquium on Automata, Languages and Programming, 2012.
Bibtex Entry:
@inproceedings{jkm12,
	author = {S. Jeffery and R. Kothari and F. Magniez},
	booktitle = {Proceedings of 39th International Colloquium on Automata, Languages and Programming},
	pages = {522-532},
	pdf = {./PAPIERS/jkm-icalp12.pdf},
	title = {Improving quantum query complexity of boolean matrix multiplication using graph collision},
	year = {2012},
	bdsk-url-1 = {./PAPIERS/jkm-icalp12.pdf}}
Powered by bibtexbrowser