scientific article; zbMATH DE number 7204263
From MaRDI portal
Publication:5111142
DOI10.4230/LIPIcs.CCC.2017.12zbMath1440.68091MaRDI QIDQ5111142
No author found.
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Communication complexity, information complexity (68Q11)
Related Items (8)
Communication complexity of approximate Nash equilibria ⋮ Deterministic Communication vs. Partition Number ⋮ Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simulation theorems via pseudo-random properties ⋮ Lifting Theorems for Equality
This page was built for publication:
