scientific article

DOI10.4086/toc.2015.v011a016zbMath1351.68105arXiv1503.02868OpenAlexW2962825398MaRDI QIDQ3467516

Aleksandrs Belovs, Eric Blais

Publication date: 2 February 2016

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.02868

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

monotonicityBoolean functionsproperty testingquantum query complexity

Mathematics Subject Classification ID

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

Related Items (4)

Parameterized property testing of functions ⋮ Adaptive Lower Bound for Testing Monotonicity on the Line ⋮ Unnamed Item ⋮ A Polynomial Lower Bound for Testing Monotonicity

Cites Work

• Quantum algorithms for learning symmetric juntas via the adversary bound

This page was built for publication: