89 citations · 407 across the 45 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 2 cited
On semiring complexity of Schur polynomials
Sergey Fomin, Dima Grigoriev, Dorian Nogneng +1
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed…
cs.CC2006★ 89 cited
Fast algorithms for computing isogenies between elliptic curves
Alin Bostan, Bruno Salvy, Francois Morain +1
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an…