Pascal Koiran, Vincent Nesme, Natacha Portier
A Quantum Lower Bound for the Query Complexity of Simon’s Problem
ICALP, 2005.
@inproceedings{ICALP-2005-KoiranNP, author = "Pascal Koiran and Vincent Nesme and Natacha Portier", booktitle = "{Proceedings of the 32nd International Colloquium on Automata, Languages and Programming}", doi = "10.1007/11523468_104", isbn = "3-540-27580-0", pages = "1287--1298", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{A Quantum Lower Bound for the Query Complexity of Simon’s Problem}", volume = 3580, year = 2005, }