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 SIAM Journal on Computing, volume 38, 2008.

Bibtex Entry:

@article{lm08,
	author = {S. Laplante and F. Magniez},
	journal = {SIAM Journal on Computing},
	number = 1,
	pages = {46-62},
	pdf = {./PAPIERS/lm-sicomp08.pdf},
	title = {Lower bounds for randomized and quantum query complexity using {K}olmogorov arguments},
	volume = 38,
	year = {2008},
	bdsk-url-1 = {./PAPIERS/lm-sicomp08.pdf}}