Timeline for computational complexity of rational parametrisation
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2020 at 8:13 | history | edited | Alm | CC BY-SA 4.0 |
added 56 characters in body
|
| Oct 20, 2020 at 7:59 | history | edited | Alm | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 20, 2020 at 7:52 | history | edited | Alm | CC BY-SA 4.0 |
added 150 characters in body
|
| Oct 20, 2020 at 7:51 | comment | added | Alm | Thanks, for the comment. I modified the question accordingly. Yes, I am mainly interested in complete intersections. | |
| Oct 20, 2020 at 7:47 | history | edited | Alm | CC BY-SA 4.0 |
added 150 characters in body
|
| Oct 20, 2020 at 7:36 | history | edited | Alm | CC BY-SA 4.0 |
added 150 characters in body
|
| Oct 19, 2020 at 20:03 | comment | added | tim | How do you encode the problem? It isn't clear from your question what the input and output should be, since you assume a rational parametrization exists, but not that it is necessarily known. Also, you assume the curve is a complete intersection --- is that necessary for you? | |
| Oct 19, 2020 at 8:36 | history | asked | Alm | CC BY-SA 4.0 |