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

Howard Barnum, Michael E. Saks (2002)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics