Timeline for Hardness of solving $0=\sum_{i=1}^k \operatorname{linear}_i(x_1,\ldots,x_n)^D$ over the rationals
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2023 at 17:13 | comment | added | Zach Teitler | In the case where the linear forms are homogeneous, you can find some work including algorithms, look up Waring rank, or symmetric rank of symmetric tensors, or CP decomposition. | |
| May 2, 2023 at 15:05 | history | edited | Michael Hardy | CC BY-SA 4.0 |
added 29 characters in body; edited title
|
| May 2, 2023 at 10:29 | history | edited | LeechLattice |
edited tags
|
|
| May 2, 2023 at 9:41 | history | asked | joro | CC BY-SA 4.0 |