Computing Jacobi symbols modulo sparse integers and polynomials and some applications

Authors:
Igor E. Shparlinski
Affiliations:
-
Venue:
Journal of Algorithms
Year:
2000

Citing 0
Cited 3

On the complexity of factoring bivariate supersparse (Lacunary) polynomials

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On lacunary polynomial perfect powers

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Detecting lacunary perfect powers and computing their roots

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract