Work

NP-hardness of p-adic linear regression

Year: 2026
Type: preprint
Abstract: $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.
Open Access status: green
OpenAlex ID: W7129419498
Cites:
Cited by:
Related to: