Timeline for Nontrivial algorithm to check for polynomial symmetry?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2011 at 10:34 | comment | added | Igor Rivin | @Jacques: yes, you are right. I was thinking of polynomials represented as black boxes or straight line programs, or?! | |
| Dec 2, 2011 at 21:40 | comment | added | Jacques Carette | @Igor: my 'algorithm' will work especially well in the sparse case. Of course, if it is sparse in a non-monomial basis, or is represented in some other way (say via a straight line program), that would indeed be a problem. But we need the OP to clarify that. | |
| Dec 2, 2011 at 21:02 | comment | added | Igor Rivin | And if it IS presented in expanded form, it is going to be gigantic. The question is of most interest if the polynomial is sparse... | |
| Dec 2, 2011 at 19:46 | history | edited | Jacques Carette | CC BY-SA 3.0 |
be more precise
|
| Dec 2, 2011 at 18:05 | history | answered | Jacques Carette | CC BY-SA 3.0 |