Rectangles Are Nonnegative Juntas

DOI10.1145/2746539.2746596MaRDI QIDQ5892101zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

communication complexityquery complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Rectangles are nonnegative juntas
• Rectangles as sums of squares
• scientific article; zbMATH DE number 4016916
• Rectangles of nonvisible lattice points
• A generalization of the rectangle condition
• scientific article; zbMATH DE number 6258433
• On non-extendable partial Latin rectangles
• Decompositions of a rectangle into non-congruent rectangles of equal area
• The rectangle complex of a relation
• scientific article; zbMATH DE number 4125412

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(11)

• Simulation theorems via pseudo-random properties
• Approximate nonnegative rank is equivalent to the smooth rectangle bound
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Low-sensitivity functions from unambiguous certificates
• Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
• Lifting Theorems for Equality
• scientific article; zbMATH DE number 7250148 (Why is no real title available?)
• scientific article; zbMATH DE number 7250149 (Why is no real title available?)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound
• Rectangles are nonnegative juntas
• On differential privacy and adaptive data analysis with bounded space

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: Rectangles Are Nonnegative Juntas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892101)