Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
Rishav Gupta, Bingkai Lin, Xin Zheng
We present a simple deterministic reduction which, assuming the Exponential Time Hypothesis (), yields tight lower bounds for approximating the parameterized Maximum…
cs.CC2026
Mind the Gap? Not for SVP Hardness under ETH!
Divesh Aggarwal, Rishav Gupta, Aditya Morolia +1
We prove new hardness results for fundamental lattice problems under the Exponential Time Hypothesis (ETH). Building on a recent breakthrough by Bitansky et al.\ \cite{BHIRW24}, wh…