Sensitivity, affine transforms and quantum communication complexity

DOI10.1007/978-3-030-26176-4_12MaRDI QIDQ6830383zbMATH OpenFDO

Authors Krishnamoorthy Dinesh, Jayalal Sarma M. N.

Publication date 24 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-26176-4_12

zbMATH Keywords

affine transformsalternationquantum communication complexitysensitivity

Mathematics Subject Classification ID

Boolean functions (06E30) Communication complexity, information complexity (68Q11) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: Sensitivity, affine transforms and quantum communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830383)