Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs
Fuente:
arXiv
Saved in:
| Main Authors: | Kothari, Pravesh K., Manohar, Peter |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
by: Kothari, Pravesh K., et al.
Published: (2025)
by: Kothari, Pravesh K., et al.
Published: (2025)
Improved Lower Bounds for all Odd-Query Locally Decodable Codes
by: Basu, Arpon, et al.
Published: (2024)
by: Basu, Arpon, et al.
Published: (2024)
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024)
by: Janzer, Oliver, et al.
Published: (2024)
Treedepth Inapproximability and Exponential ETH Lower Bound
by: Bonnet, Édouard, et al.
Published: (2025)
by: Bonnet, Édouard, et al.
Published: (2025)
Exponential Lower Bounds on the Size of ResLin Proofs of Nearly Quadratic Depth
by: Bhattacharya, Sreejata Kishor, et al.
Published: (2025)
by: Bhattacharya, Sreejata Kishor, et al.
Published: (2025)
Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)
by: Block, Alexander R., et al.
Published: (2026)
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)
by: Blocki, Jeremiah, et al.
Published: (2021)
Bounded-Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions
by: Gryaznov, Svyatoslav, et al.
Published: (2024)
by: Gryaznov, Svyatoslav, et al.
Published: (2024)
Rounding Large Independent Sets on Expanders
by: Bafna, Mitali, et al.
Published: (2024)
by: Bafna, Mitali, et al.
Published: (2024)
A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
by: Jansen, Klaus, et al.
Published: (2025)
by: Jansen, Klaus, et al.
Published: (2025)
Local Enumeration and Majority Lower Bounds
by: Gurumukhani, Mohit, et al.
Published: (2024)
by: Gurumukhani, Mohit, et al.
Published: (2024)
Spectral Lower Bounds for Local Search
by: Brânzei, Simina, et al.
Published: (2024)
by: Brânzei, Simina, et al.
Published: (2024)
Lower Bounds for Approximate Sign Rank
by: Bindua, Riju, et al.
Published: (2026)
by: Bindua, Riju, et al.
Published: (2026)
Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities
by: Byramji, Farzan, et al.
Published: (2025)
by: Byramji, Farzan, et al.
Published: (2025)
A Quadratic Lower Bound for Noncommutative Circuits
by: Shastri, Pratik
Published: (2026)
by: Shastri, Pratik
Published: (2026)
IPS Lower Bounds for Formulas and Sum of ROABPs
by: Chatterjee, Prerona, et al.
Published: (2025)
by: Chatterjee, Prerona, et al.
Published: (2025)
Lower Bounds for Set-Multilinear Branching Programs
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
Lower Bounds from Succinct Hitting Sets
by: Chatterjee, Prerona, et al.
Published: (2023)
by: Chatterjee, Prerona, et al.
Published: (2023)
Lower Bounds for Conjunctive Query Evaluation
by: Mengel, Stefan
Published: (2025)
by: Mengel, Stefan
Published: (2025)
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)
by: Gamarnik, David, et al.
Published: (2023)
Tight Lower Bounds for Block-Structured Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2024)
by: Hunkenschröder, Christoph, et al.
Published: (2024)
Convergent Gate Elimination and Constructive Circuit Lower Bounds
by: Carmosino, Marco, et al.
Published: (2026)
by: Carmosino, Marco, et al.
Published: (2026)
Top-Down Lower Bounds for Depth-Four Circuits
by: Göös, Mika, et al.
Published: (2023)
by: Göös, Mika, et al.
Published: (2023)
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
by: Gajulapalli, Karthik, et al.
Published: (2025)
by: Gajulapalli, Karthik, et al.
Published: (2025)
Lower Bounds for Subset Sum in Resolution with Modular Counting
by: Part, Fedor
Published: (2022)
by: Part, Fedor
Published: (2022)
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
by: Hsieh, Jun-Ting, et al.
Published: (2024)
by: Hsieh, Jun-Ting, et al.
Published: (2024)
Improved Lower Bounds for QAC0
by: Joshi, Malvika Raj, et al.
Published: (2025)
by: Joshi, Malvika Raj, et al.
Published: (2025)
Lower Bounds for Convexity Testing
by: Chen, Xi, et al.
Published: (2024)
by: Chen, Xi, et al.
Published: (2024)
A Lower Bound on Conservative Elementary Object Systems Coverability
by: Di Cosmo, Francesco, et al.
Published: (2025)
by: Di Cosmo, Francesco, et al.
Published: (2025)
Lower Bounds against the Ideal Proof System in Finite Fields
by: Elbaz, Tal, et al.
Published: (2025)
by: Elbaz, Tal, et al.
Published: (2025)
Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians
by: Kocurek, Nicholas
Published: (2025)
by: Kocurek, Nicholas
Published: (2025)
Optimal Monotone Depth-Three Circuit Lower Bounds for Majority
by: Gurumukhani, Mohit, et al.
Published: (2026)
by: Gurumukhani, Mohit, et al.
Published: (2026)
Query Lower Bounds for Correlation Clustering under Memory Constraints
by: Garg, Sumegha, et al.
Published: (2026)
by: Garg, Sumegha, et al.
Published: (2026)
Upper and Lower Bounds on $T_1$ and $T_2$ Decision Tree Model
by: Alhamdan, Yousef M.
Published: (2025)
by: Alhamdan, Yousef M.
Published: (2025)
Separations above TFNP from Sherali-Adams Lower Bounds
by: Fleming, Noah, et al.
Published: (2026)
by: Fleming, Noah, et al.
Published: (2026)
The Quasi-Polynomial Low-Degree Conjecture is False
by: Buhai, Rares-Darius, et al.
Published: (2025)
by: Buhai, Rares-Darius, et al.
Published: (2025)
Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)
by: Pago, Benedikt
Published: (2026)
Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes
by: Ostonov, Azimkhon, et al.
Published: (2024)
by: Ostonov, Azimkhon, et al.
Published: (2024)
Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
by: Raz, Ran
Published: (2026)
by: Raz, Ran
Published: (2026)
Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification
by: Alman, Josh, et al.
Published: (2025)
by: Alman, Josh, et al.
Published: (2025)
Similar Items
-
Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
by: Kothari, Pravesh K., et al.
Published: (2025) -
Improved Lower Bounds for all Odd-Query Locally Decodable Codes
by: Basu, Arpon, et al.
Published: (2024) -
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024) -
Treedepth Inapproximability and Exponential ETH Lower Bound
by: Bonnet, Édouard, et al.
Published: (2025) -
Exponential Lower Bounds on the Size of ResLin Proofs of Nearly Quadratic Depth
by: Bhattacharya, Sreejata Kishor, et al.
Published: (2025)