Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Hideaki Fukuhara' in GoogleThis author has not been identified. Look up 'Eiji Takimoto' in Google

runs on WebDSL