NP-hardness of p-adic linear regression
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917274342916096 |
|---|---|
| author | Baker, Gregory D. |
| author_facet | Baker, Gregory D. |
| contents | $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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_13278 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | NP-hardness of p-adic linear regression Baker, Gregory D. Computational Complexity Number Theory 68Q17 F.2.2; F.1.3 $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. |
| title | NP-hardness of p-adic linear regression |
| topic | Computational Complexity Number Theory 68Q17 F.2.2; F.1.3 |
| url | https://arxiv.org/abs/2602.13278 |