%0 Conference Paper %1 conf/coco/LaplanteM04 %A Laplante, Sophie %A Magniez, Frédéric %B CCC %D 2004 %I IEEE Computer Society %K dblp %P 294-304 %T Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. %U http://dblp.uni-trier.de/db/conf/coco/coco2004.html#LaplanteM04 %@ 0-7695-2120-7

@inproceedings{conf/coco/LaplanteM04, added-at = {2023-03-24T00:00:00.000+0100}, author = {Laplante, Sophie and Magniez, Frédéric}, biburl = {https://www.bibsonomy.org/bibtex/255eff151d499f8d9d68553da158e47a9/dblp}, booktitle = {CCC}, crossref = {conf/coco/2004}, ee = {https://doi.ieeecomputersociety.org/10.1109/CCC.2004.1313852}, interhash = {a36b9c0ad21998b64f8be3c6f660a278}, intrahash = {55eff151d499f8d9d68553da158e47a9}, isbn = {0-7695-2120-7}, keywords = {dblp}, pages = {294-304}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T01:29:55.000+0200}, title = {Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.}, url = {http://dblp.uni-trier.de/db/conf/coco/coco2004.html#LaplanteM04}, year = 2004 }