JSC
2011
12 years 8 months ago
2011
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
JSC
2011
12 years 8 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
JSC
2011
13 years 2 hour ago
2011
JSC
2011
13 years 2 hour ago
2011
JSC
2011
13 years 2 hour ago
2011
JSC
2011
13 years 2 hour ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
JSC
2011
13 years 2 hour ago
2011
JSC
2011
13 years 2 hour ago
2011
Homotopy continuation provides a numerical tool for computing the equivalence of a smooth variety in an intersection product. Intersection theory provides a theoretical tool for re...
JSC
2011
13 years 2 hour ago
2011
JSC
2011
13 years 2 hour ago
2011
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for...