Timeline for Intersection of quadratic equations with planted solutions?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2019 at 18:12 | comment | added | Alexandre Eremenko | I don't know but if you type "complexity of elimination" on the Google, you immediately get a list of papers on the subject. | |
| May 24, 2019 at 18:07 | comment | added | Turbo | Is this just plain vanilla elimination theory? Would you know the complexity when there are no linear terms and no $x_i^2$ terms (there are only $x_ix_j$ terms and constant term)? | |
| May 24, 2019 at 18:07 | vote | accept | Turbo | ||
| May 24, 2019 at 18:05 | comment | added | Alexandre Eremenko | @Brout: yes, $n$ will not be enough. | |
| May 24, 2019 at 18:02 | comment | added | Turbo | So $n+1$ random equations needed even if $1$ planted solution? | |
| May 24, 2019 at 12:12 | history | answered | Alexandre Eremenko | CC BY-SA 4.0 |