Author： Feng D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.226, Iss.1, 1999-09, pp. : 37-43
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
Attack on RSA-type cryptosystems based on singular cubic curves over Z/nZ
By Chua S.K.S.K. Leung K.H.K.H. Ling S.
Theoretical Computer Science, Vol. 226, Iss. 1, 1999-09 ,pp. :
Access to resources
Recommend
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
Analogs of Grobner Bases in Polynomial Rings over a Ring
By Miller L.J.
Journal of Symbolic Computation, Vol. 21, Iss. 2, 1996-02 ,pp. :
Topological adjacency relations on Z n
By Kong T.Y.
Theoretical Computer Science, Vol. 283, Iss. 1, 2002-06 ,pp. :
Calculating Invariant Rings of Finite Groups over Arbitrary Fields
By Kemper G.
Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. :