A lower bound on the quantum query complexity of read-once functions

Howard Barnum Michael E. Saks A lower bound on the quantum query complexity of read-once functions Electronic Colloquium on Computational Complexity (ECCC) 2002 002 db/journals/eccc/eccc9.html#ECCC-TR02-002 http://eccc.hpi-web.de/eccc-reports/2002/TR02-002/index.html