scientific article; zbMATH DE number 6829272
From MaRDI portal
DOI10.4230/LIPIcs.CCC.2015.88zbMath1388.68093MaRDI QIDQ4601824
Publication date: 24 January 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Interactive Information Complexity, Communication Lower Bounds via Critical Block Sensitivity, Interactive Information Complexity, Unnamed Item, Unnamed Item, A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$, Simulation theorems via pseudo-random properties, Rectangles Are Nonnegative Juntas, The Multiparty Communication Complexity of Set Disjointness, Lifting Theorems for Equality, Unnamed Item, Unnamed Item