31. 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) ↗
32. 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) ↗
33. A new algorithm for computing staggered linear bases. (July 2023) Authors: Hashemi, Amir; Michael Möller, H. Journal: Journal of symbolic computation Issue: Volume 117(2023) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
34. A new faster algorithm for factoring skew polynomials over finite fields. (March 2017) Authors: Caruso, Xavier; Le Borgne, Jérémy Journal: Journal of symbolic computation Issue: Volume 79(2017)Part 2 Page Start: 411 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
35. A new general formula for the Cauchy index on an interval with subresultants. (March 2022) Authors: Perrucci, Daniel; Roy, Marie-Françoise Journal: Journal of symbolic computation Issue: Volume 109(2022) Page Start: 465 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
36. A persistence landscapes toolbox for topological statistics. (January 2017) Authors: Bubenik, Peter; Dłotko, Paweł Journal: Journal of symbolic computation Issue: Volume 78(2017) Page Start: 91 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
37. A practical model for computation with matrix groups. (May 2015) Authors: Bäärnhielm, Henrik; Holt, Derek; Leedham-Green, C.R.; O'Brien, E.A. Journal: Journal of symbolic computation Issue: Volume 68:Part 1(2015) Page Start: 27 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
38. A probabilistic algorithm for computing data-discriminants of likelihood equations. (November 2017) Authors: Rodriguez, Jose Israel; Tang, Xiaoxian Journal: Journal of symbolic computation Issue: Volume 83(2017) Page Start: 342 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
39. A sharp bound on the number of real intersection points of a sparse plane curve with a line. (July 2017) Authors: Bihan, Frédéric; El Hilany, Boulos Journal: Journal of symbolic computation Issue: Volume 81(2017) Page Start: 88 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
40. A short proof for the open quadrant problem. (March 2017) Authors: Fernando, José F.; Ueno, Carlos Journal: Journal of symbolic computation Issue: Volume 79(2017)Part 1 Page Start: 57 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗