@inproceedings{3b8b4ac2ea3949a990570873f4210d95,
title = "Some graph problems with equivalent lower bounds for query complexity",
abstract = "The paper [4] by H.Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A. Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds.",
keywords = "Lower bounds, Quantum computation, Query algorithms",
author = "Lelde Lace and Renate Praude and Rusiņ{\v s} Freivalds",
year = "2005",
language = "English",
isbn = "9781932415711",
series = "Proceedings of the 2005 International Conference on Foundations of Computer Science, FCS'05",
pages = "80--86",
booktitle = "Proceedings of the 2005 International Conference on Foundations of Computer Science, FCS'05",
note = "2005 International Conference on Foundations of Computer Science, FCS'05 ; Conference date: 27-06-2005 Through 30-06-2005",
}