Rectangles Are Nonnegative Juntas
From MaRDI portal
Publication:5892101
DOI10.1145/2746539.2746596zbMath1321.68313OpenAlexW2040889609MaRDI QIDQ5892101
No author found.
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/7v71k6z6
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ On differential privacy and adaptive data analysis with bounded space ⋮ Approximate nonnegative rank is equivalent to the smooth rectangle bound ⋮ Simulation theorems via pseudo-random properties ⋮ Rectangles Are Nonnegative Juntas ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lifting Theorems for Equality ⋮ Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Rectangles Are Nonnegative Juntas
