Author: Shparlinski I.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 273-275
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On a method for finding the roots of an ideal
Programming and Computer Software, Vol. 31, Iss. 2, 2005-03 ,pp. :
On the List of Finite Primitive Permutation Groups of Degree < 50
Journal of Symbolic Computation, Vol. 22, Iss. 2, 1996-02 ,pp. :
Algorithms for Exponentiation in Finite Fields
By Gao S. von zur gathen J. Panario D. Shoup V.
Journal of Symbolic Computation, Vol. 29, Iss. 6, 2000-06 ,pp. :
Lattices of Compatibly Embedded Finite Fields
By Bosma W. Cannon J. Steel A.
Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. :