$p$-adic linear regression is the problem of finding coefficients $β$ that minimise $\sum_i |y_i - x_i^\topβ|_p$. We prove that computing an optimal solution is NP-hard via a polynomial-time reduction from Max Cut using a regularisation gadget.

翻译：p进线性回归是寻找最小化$\sum_i |y_i - x_i^\topβ|_p$的系数$β$的问题。我们通过从最大割问题的多项式时间归约（使用正则化工具）证明计算最优解是NP困难的。