%0 Journal Article %1 journals/jcss/BarnumS04 %A Barnum, Howard %A Saks, Michael E. %D 2004 %J J. Comput. Syst. Sci. %K dblp %N 2 %P 244-258 %T A lower bound on the quantum query complexity of read-once functions. %U http://dblp.uni-trier.de/db/journals/jcss/jcss69.html#BarnumS04 %V 69

@article{journals/jcss/BarnumS04, added-at = {2021-02-16T00:00:00.000+0100}, author = {Barnum, Howard and Saks, Michael E.}, biburl = {https://www.bibsonomy.org/bibtex/28fae44faa3d2579805dd813744be5640/dblp}, ee = {https://www.wikidata.org/entity/Q62117306}, interhash = {56d0d1489a41a918cd3bb04c7d1ce441}, intrahash = {8fae44faa3d2579805dd813744be5640}, journal = {J. Comput. Syst. Sci.}, keywords = {dblp}, number = 2, pages = {244-258}, timestamp = {2024-04-08T19:14:58.000+0200}, title = {A lower bound on the quantum query complexity of read-once functions.}, url = {http://dblp.uni-trier.de/db/journals/jcss/jcss69.html#BarnumS04}, volume = 69, year = 2004 }