%0 Conference Paper %1 conf/cats/FukuharaT09 %A Fukuhara, Hideaki %A Takimoto, Eiji %B CATS %D 2009 %E Downey, Rod %E Manyem, Prabhu %I Australian Computer Society %K dblp %P 89-98 %T Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. %U http://dblp.uni-trier.de/db/conf/cats/cats2009.html#FukuharaT09 %V 94 %@ 978-1-920682-75-0

@inproceedings{conf/cats/FukuharaT09, added-at = {2021-02-08T00:00:00.000+0100}, author = {Fukuhara, Hideaki and Takimoto, Eiji}, biburl = {https://www.bibsonomy.org/bibtex/2f3bba1b0a5d54c29005537cd50d39782/dblp}, booktitle = {CATS}, crossref = {conf/cats/2009}, editor = {Downey, Rod and Manyem, Prabhu}, ee = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV94Fukuhara.html}, interhash = {05d3e7dc661b396e8afa5b6b49825d6f}, intrahash = {f3bba1b0a5d54c29005537cd50d39782}, isbn = {978-1-920682-75-0}, keywords = {dblp}, pages = {89-98}, publisher = {Australian Computer Society}, series = {CRPIT}, timestamp = {2024-04-10T00:25:06.000+0200}, title = {Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes.}, url = {http://dblp.uni-trier.de/db/conf/cats/cats2009.html#FukuharaT09}, volume = 94, year = 2009 }