Computing x mod p(x) and an Application to Splitting a Polynomial Into Factors Over a Fixed Disc

Author： Pan V.Y.  

Publisher： Academic Press

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.22, Iss.4, 1996-10, pp. : 377-380

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A broadband P2P MoD system: its implementation and application

By Liu Shyh-Chang   Chen Tsung-Hung   Wang Peng-Shiang  

International Journal of High Performance Computing and Networking, Vol. 5, Iss. 5-6, 2009-05 ,pp. : 353-363

Inderscience Publishers

Access to resources Recommend Favorite

Connecting IPvX Networks Over IPvY with a P2P Method

By Leng Xiaoxiang   Bi Jun   Zhang Miao   Wu Jianping  

Journal of Network and Systems Management, Vol. 15, Iss. 3, 2007-09 ,pp. : 383-399

Springer Publishing Company

Access to resources Recommend Favorite

On the application of the P1mod element to incompressible flow problems

By Knobloch Petr  

Computing and Visualization in Science, Vol. 6, Iss. 4, 2004-04 ,pp. : 185-195

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of Contributing/Influencing Factors

By  

SourceOECD Science & Information Technology, Vol. 2008, Iss. 15, 2008-11 ,pp. : 54-105

OECD Publishing

Access to resources Recommend Favorite

Polynomial-based radial basis function neural networks (P-RBF NNs) and their application to pattern classification

By Park Byoung-Jun   Pedrycz Witold   Oh Sung-Kwun  

Applied Intelligence, Vol. 32, Iss. 1, 2010-02 ,pp. : 27-46

Springer Publishing Company

Access to resources Recommend Favorite