scientific article; zbMATH DE number 7559168
From MaRDI portal
Publication:5088887
DOI10.4230/LIPIcs.STACS.2019.59MaRDI QIDQ5088887
No author found.
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean function complexity. Advances and frontiers.
- The 1-versus-2 queries problem revisited
- Complexity measures and decision tree complexity: a survey.
- Separation of the monotone NC hierarchy
- Communication complexity of approximate Nash equilibria
- On zero error algorithms having oracle access to one query
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
- Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
- Forrelation
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- Approximate Constraint Satisfaction Requires Large LP Relaxations
- The Pattern Matrix Method
- Deterministic Communication vs. Partition Number
- The Landscape of Communication Complexity Classes.
- Low-Sensitivity Functions from Unambiguous Certificates.
- Communication Complexity
- Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
- Strongly exponential lower bounds for monotone computation
- Communication Complexity
- Communication lower bounds via critical block sensitivity
- Separations in query complexity using cheat sheets
- Lower Bounds for Quantum Communication Complexity
- Rectangles Are Nonnegative Juntas
This page was built for publication:
