Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma
Main Authors: | Chen, Lijie, Lyu, Xin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145913 |
Similar Items
-
Strong Average-Case Lower Bounds from Non-trivial Derandomization
by: Chen, Lijie, et al.
Published: (2022) -
Algorithms, bounds, and strategies for entangled XOR games
by: Watts, Adam Bene, et al.
Published: (2020) -
Bounds for graph regularity and removal lemmas
by: Conlon, David, et al.
Published: (2013) -
Derandomization of auctions
by: Aggarwal, Gagan, et al.
Published: (2015) -
Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games
by: Briët, Jop, et al.
Published: (2016)