Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs

Documenti analoghi

• Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
  di: Kothari, Pravesh K., et al.
  Pubblicazione: (2025)
• Improved Lower Bounds for all Odd-Query Locally Decodable Codes
  di: Basu, Arpon, et al.
  Pubblicazione: (2024)
• A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
  di: Janzer, Oliver, et al.
  Pubblicazione: (2024)
• Treedepth Inapproximability and Exponential ETH Lower Bound
  di: Bonnet, Édouard, et al.
  Pubblicazione: (2025)
• Exponential Lower Bounds on the Size of ResLin Proofs of Nearly Quadratic Depth
  di: Bhattacharya, Sreejata Kishor, et al.
  Pubblicazione: (2025)