Lower bounds for randomized and quantum query complexity using Kolmogorov arguments (bibtex)

by S. Laplante and F. Magniez

Reference:

Lower bounds for randomized and quantum query complexity using Kolmogorov arguments (S. Laplante and F. Magniez), In Proceedings of 19th IEEE Conference on Computational Complexity, 2004.

Bibtex Entry:

@inproceedings{lm04,
	author = {S. Laplante and F. Magniez},
	booktitle = {Proceedings of 19th IEEE Conference on Computational Complexity},
	pages = {214-304},
	pdf = {./PAPIERS/lm-complexity04.pdf},
	title = {Lower bounds for randomized and quantum query complexity using {K}olmogorov arguments},
	year = {2004},
	bdsk-url-1 = {./PAPIERS/lm-complexity04.pdf}}