scientific article
From MaRDI portal
Publication:3633949
zbMath1172.81320arXiv0710.0095MaRDI QIDQ3633949
Publication date: 23 June 2009
Full work available at URL: https://arxiv.org/abs/0710.0095
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
communication complexityquantum information processingquantum lower boundpolynomial approximation of Boolean functions
Related Items (24)
The Range of Topological Effects on Communication ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ Deterministic Communication vs. Partition Number ⋮ Around the log-rank conjecture ⋮ Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The unbounded-error communication complexity of symmetric functions ⋮ Query-to-Communication Lifting for BPP ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ The NOF multiparty communication complexity of composed functions ⋮ Simulation theorems via pseudo-random properties ⋮ On derandomized composition of Boolean functions ⋮ Rectangles Are Nonnegative Juntas ⋮ Sensitivity, affine transforms and quantum communication complexity ⋮ The Multiparty Communication Complexity of Set Disjointness ⋮ Lifting Theorems for Equality ⋮ Query-To-Communication Lifting for BPP Using Inner Product ⋮ Unnamed Item ⋮ Communication Lower Bounds Using Directional Derivatives ⋮ Query-to-Communication Lifting Using Low-Discrepancy Gadgets ⋮ Unnamed Item ⋮ Dual lower bounds for approximate degree and Markov-Bernstein inequalities
This page was built for publication:
