Hideaki Fukuhara, Eiji Takimoto. Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. In Rod Downey, Prabhu Manyem, editors, Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. Volume 94 of CRPIT, pages 89-98, Australian Computer Society, 2009. [doi]
@inproceedings{FukuharaT09,
title = {Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes},
author = {Hideaki Fukuhara and Eiji Takimoto},
year = {2009},
url = {http://crpit.com/abstracts/CRPITV94Fukuhara.html},
researchr = {https://researchr.org/publication/FukuharaT09},
cites = {0},
citedby = {0},
pages = {89-98},
booktitle = {Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009},
editor = {Rod Downey and Prabhu Manyem},
volume = {94},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {978-1-920682-75-0},
}