Similar Items: Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
- Lower Bounds for Approximate Sign Rank
- On Sampling Lower Bounds for Polynomials
- From Gödel incompleteness to the consistency of circuit lower bounds
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Maximum Matching and Related Problems in Catalytic Logspace
- Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study