A p-adic algorithm for univariate partial fractions

No abstract is available for this paper.

• Publication year

  1981

• Venue

  Symposium on Symbolic and Algebraic Manipulation

• Publication date

  1981-08-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/800206.806398
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An improved multivariate polynomial factoring algorithm

  1978cited by this paper
• Fast Algorithms for Partial Fraction Decomposition

  1977cited by this paper
• On the subresultant PRS algorithm

  1976cited by this paper
• Symbolic integration the stormy decade

  1971cited by this paper
• The problem of integration in finite terms

  1969cited by this paper
• The Art of Computer Programming

  1968cited by this paper
• Subresultants and Reduced Polynomial Remainder Sequences

  1967cited by this paper
• Network analysis and synthesis

  1962cited by this paper
• Network Analysis and Synthesis

  1962cited by this paper

• Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing

  2026cites this paper
• Sampling Polynomial Rational Remainders with SP$\mathbb{Q}$R: A new Package for Polynomial Division and Elimination

  2025cites this paper
• LinApart2: efficient parallel partial fraction decomposition algorithm for denominators with polynomials of general degree

  2025cites this paper
• Reconstructing Laurent expansion of rational functions using p-adic numbers

  2025cites this paper
• FIRE 7: Automatic Reduction with Modular Approach

  2025cites this paper
• Scaling up to multivariate rational function reconstruction

  2024cites this paper
• Cryptanalysis of Algebraic Verifiable Delay Functions

  2024cites this paper
• LinApart: optimizing the univariate partial fraction decomposition

  2024cites this paper
• A comprehensive analysis of Regev's quantum algorithm

  2024cites this paper
• Feynman integral reduction: balanced reconstruction of sparse rational functions and implementation on supercomputers in a co-design approach

  2024cites this paper
• Interpolation of rational functions in loop calculations by using p-adic numbers

  2024cites this paper
• Balancing act: Multivariate rational reconstruction for IBP

  2023cites this paper
• p-adic reconstruction of rational functions in multi-loop amplitudes

  2023cites this paper
• FiniteFieldSolve: Exactly solving large linear systems in high-energy theory

  2023cites this paper
• Computing torsion for plane quartics without using height bounds

  2023cites this paper
• Two-loop leading colour QCD helicity amplitudes for top quark pair production in the gluon fusion channel

  2021cites this paper
• Standard Model EFTs via on-shell methods

  2021cites this paper
• Two-Loop QCD Corrections to Wbb[over ¯] Production at Hadron Colliders.

  2021cites this paper
• Integral reduction with Kira 2.0 and finite field methods

  2020cites this paper
• Interpolation of Dense and Sparse Rational Functions and other Improvements in FireFly

  2020cites this paper
• On the Complexity Exponent of Polynomial System Solving

  2020cites this paper
• A Practical Approach to the Secure Computation of the Moore-Penrose Pseudoinverse over the Rationals

  2020cites this paper
• Applied Cryptography and Network Security: 18th International Conference, ACNS 2020, Rome, Italy, October 19–22, 2020, Proceedings, Part I

  2020cites this paper
• CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations

  2020cites this paper
• Reconstructing Rational Functions with FireFly

  2019cites this paper
• FiniteFlow: multivariate functional reconstruction using finite fields and dataflow graphs

  2019cites this paper
• Results and techniques for higher order calculations within the gradient-flow formalism

  2019cites this paper
• D2.3 Use-Case Specific Algorithms

  2019cites this paper
• Sufficiently overdetermined random polynomial systems behave like semiregular ones

  2019cites this paper
• New results for two-loop scattering in quantum chromodynamics

  2019cites this paper
• FiniteFlow: multivariate functional reconstruction using finite fields and dataflow graphs

  2019cites this paper
• The Mersenne Low Hamming Combination Search Problem can be reduced to an ILP Problem

  2019cites this paper
• Results and techniques for higher order calculations within the gradient-flow formalism

  2019cites this paper
• Analytic form of the planar two-loop five-parton scattering amplitudes in QCD

  2019cites this paper
• Analytic Form of Planar Two-Loop Five-Gluon Scattering Amplitudes in QCD.

  2018cites this paper
• Applications of integrand reduction to two-loop five-point scattering amplitudes in QCD

  2018cites this paper
• Computing polynomial greatest common divisors using sparse interpolation

  2018cites this paper
• D2.2 Application-Oriented MPC Protocols

  2018cites this paper
• A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions

  2016cites this paper
• Scattering amplitudes over finite fields and multivariate functional reconstruction

  2016cites this paper
• Scattering amplitudes over finite fields and multivariate functional reconstruction

  2016cites this paper
• Fault-tolerant modular reconstruction of rational numbers

  2013cites this paper
• The use of bad primes in rational reconstruction

  2012cites this paper
• Solving Very Sparse Rational Systems of Equations

  2011cites this paper
• Exact solutions to linear systems of equations using output sensitive lifting

  2011cites this paper
• FAST MULTIPLICATION OVER ALGEBRAIC NUMBER FIELDS

  2011cites this paper
• Efficient algorithms for computations with sparse polynomials

  2011cites this paper
• Limit Cycles and Centers in a cubic Planar System

  2010cites this paper
• Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden

  2010cites this paper
• Topics in exact precision mathematical programming

  2010cites this paper
• Greatest Common Divisors and Factorizations in Quadratic Number Fields

  2010cites this paper
• Algorithms for solving linear systems over cyclotomic fields

  2010cites this paper
• Generic implementation of a modular GCD over Algebraic Extension Fields

  2009influential citation
• A family of exceptional Stewart-Gough mechanisms of genus 7

  2009cites this paper
• Evaluation of different approaches in 3 D curved kernel for arrangements of quadrics

  2008cites this paper
• DEVELOPMENT OF SYMBOLIC ALGORITHMS FOR CERTAIN

  2007cites this paper
• A sparse modular GCD algorithm for polynomials over algebraic function fields

  2007cites this paper
• Towards an exact adaptive algorithm for the determinant of a rational matrix

  2007influential citation
• Linearizability of linear systems perturbed by fifth degree homogeneous polynomials

  2007cites this paper
• Development of symbolic algorithms for certain algebraic processes

  2007cites this paper
• Fast rational function reconstruction

  2006cites this paper
• Solving Sparse Integer Linear Systems

  2006cites this paper
• Solving sparse rational linear systems

  2006cites this paper
• Algorithms for polynomial GCD computation over algebraic function fields

  2004influential citation
• Arithmétique et algorithmique en algèbre linéaire exacte pour la bibliothèque LinBox. (Arithmetic and algorithmic in exact linear algebra for the LinBox library)

  2004cites this paper
• Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction

  2004cites this paper
• Solution of Systems of Linear Equations by the p-Adic Method

  2003influential citation
• Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems

  2000influential citation
• A modular algorithm for computing greatest common right divisors of Ore polynomials

  1997cites this paper
• Improved Techniques for Factoring Univariate Polynomials

  1996cites this paper
• The accelerated integer GCD algorithm

  1995cites this paper
• E cient Rational Number Reconstruction

  1994cites this paper
• Quantitative Estimates for Polynomials in One or Several Variables

  1994cites this paper
• On a modular algorithm for computing GCDs of polynomials over algebraic number fields

  1994cites this paper
• A generalization of the binary GCD algorithm

  1993cites this paper
• Complexity of Computations with Matrices and Polynomials

  1992cites this paper
• On integer-to-rational conversion algorithm

  1992influential citation
• Computing greatest common divisors and factorizations in quadratic number fields

  1989cites this paper
• Symbolic solution of large stationary chemical kinetics problems

  1989cites this paper
• Implementation of the LISP-Arbitrary Precision Arithmetic for a Vector Processor.

  1988cites this paper
• Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations

  1988cites this paper
• On Gröbner Bases Computation on a Supercomputer Using REDUCE.

  1988cites this paper
• Computer Algebra Algorithms

  1987cites this paper
• Arithmetic in Quadratic Fields with Unique Factorization

  1985influential citation
• Implementation of a p-adic Package for Polynomial Factorization and Other Related Operations

  1984cites this paper
• Algebraic Approach to p-adic Conversion of Rational Numbers

  1984cites this paper
• Early detection of true factors in univariate polynominal factorization

  1983cites this paper
• P-adic reconstruction of rational numbers

  1982cites this paper
• The conversion of Hensel codes to their rational equivalents: or how to solve the Gregory's open problem

  1982cites this paper
• Analysis of MinRoot : Public report (

  year unknowncites this paper
• Two-Loop QCD Corrections to Wb ¯ b Production at Hadron Colliders

  year unknowncites this paper