scientific article; zbMATH DE number 6789270

DOI10.4230/LIPIcs.CCC.2016.5zbMath1380.68198MaRDI QIDQ5368739

T. S. Jayram, Mika Göös

Publication date: 10 October 2017

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

zbMATH Keywords

composition theoremsconical juntas

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Communication complexity with small advantage ⋮ Unnamed Item ⋮ Separation Between Deterministic and Randomized Query Complexity ⋮ Rectangles Are Nonnegative Juntas ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Query-To-Communication Lifting for BPP Using Inner Product ⋮ Query-to-Communication Lifting Using Low-Discrepancy Gadgets ⋮ A Composition Theorem for Randomized Query Complexity

This page was built for publication: