Quantum Query Complexity of Boolean Functions with Small On-Sets

DOI10.1007/978-3-540-92182-0_79zbMath1183.68291DBLPconf/isaac/AmbainisINNRTY08OpenAlexW1550265671WikidataQ56701651 ScholiaQ56701651MaRDI QIDQ3597889

Seiichiro Tani, Rudy Raymond, Masaki Nakanishi, Shigeru Yamashita, Harumichi Nishimura, Kazuo Iwama, Andris Ambainis

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_79

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC

This page was built for publication: Quantum Query Complexity of Boolean Functions with Small On-Sets