The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Implementing a polynomial factorization and GCD package
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A p-adic algorithm for univariate partial fractions
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
ACM SIGSAM Bulletin
The Bath algebraic number package
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Recovery of algebraic numbers from their p-adic approximations
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On integer-to-rational conversion algorithm
ACM SIGSAM Bulletin
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A modular algorithm for computing greatest common right divisors of Ore polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Computing univariate GCDs over number fields
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A modular GCD algorithm over number fields presented with multiple extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Probabilistic algorithms for computing resultants
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing Equiangular Lines in Complex Space
Mathematical Methods in Computer Science
Implementing data parallel rational multiple-residue arithmetic in eden
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Computers & Mathematics with Applications
Parallelization of Modular Algorithms
Journal of Symbolic Computation
Normal forms of two p :: -q resonant polynomial vector fields
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Isochronicity and normal forms of polynomial systems of ODEs
Journal of Symbolic Computation
The resonant center problem for a 2: -3 resonant cubic lotka---volterra system
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Investigation of center manifolds of three-dimensional systems using computer algebra
Programming and Computing Software
| Hi-index | 0.00 |
In a recent paper, Wang [1981] introduces a p-adic algorithm for the construction of partial fraction decompositions. This differs from the usual p-adic algorithms for factorisation or the computation of greatest common divisors ([Wang, 1978], [Wang, 1980], [Moore & Norman, 1981]) in that the p-adic image is used to reconstruct rational numbers, rather than integers.