1. A condition for multiplicity structure of univariate polynomials. (May 2021) Authors: Hong, Hoon; Yang, Jing Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 523 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A constructive method for decomposing real representations. (May 2021) Authors: Ali, Sajid; Azad, Hassan; Biswas, Indranil; de Graaf, Willem A. Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 328 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A fast algorithm for computing multiplicative relations between the roots of a generic polynomial. (May 2021) Authors: Zheng, Tao Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 381 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A fast parallel sparse polynomial GCD algorithm. (July 2021) Authors: Hu, Jiaxiong; Monagan, Michael Journal: Journal of symbolic computation Issue: Volume 105(2021) Page Start: 28 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. A generalization of the Katzman-Zhang algorithm. (March 2021) Authors: Yeşil, Mehmet Journal: Journal of symbolic computation Issue: Volume 103(2021) Page Start: 213 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. A generic and executable formalization of signature-based Gröbner basis algorithms. (September 2021) Authors: Maletzky, Alexander Journal: Journal of symbolic computation Issue: Volume 106(2021) Page Start: 23 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. A method of verifying partition congruences by symbolic computation. (May 2021) Authors: Radu, Cristian-Silviu; Smoot, Nicolas Allen Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 105 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. A multi-computational exploration of some games of pure chance. (May 2021) Authors: Thanatipanonda, Thotsaporn "Aek"; Zeilberger, Doron Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 38 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. A nearly optimal algorithm to decompose binary forms. (July 2021) Authors: Bender, Matías R.; Faugère, Jean-Charles; Perret, Ludovic; Tsigaridas, Elias Journal: Journal of symbolic computation Issue: Volume 105(2021) Page Start: 71 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals. (November 2021) Authors: Nabeshima, Katsusuke; Tajima, Shinichi Journal: Journal of symbolic computation Issue: Volume 107(2021) Page Start: 190 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗