Note that some of equations in this abstract may have been omitted or may be displayed incorrectly.
|Cite as: Fukuhara, H. and Takimoto, E. (2009). Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. In Proc. Fifteenth Computing: The Australasian Theory Symposium (CATS 2009), Wellington, New Zealand. CRPIT, 94. Downey, R. and Manyem, P., Eds. ACS. 89-98.|
|(from crpit.com) (local if available)|