Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Polynomial arithmetic

Polynomial arithmetic is a branch of algebra dealing with some properties of polynomials which share strong analogies with properties of number… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Arb is a C library for arbitrary-precision interval arithmetic using the midpoint-radius representation, also known as ball… Expand
  • table 1
  • table 2
  • table 4
  • table 3
  • figure 1
2014
2014
Arb 1 is a new open source C library for provably correct arbitrary-precision numerics, extending FLINT [3] (which provides fast… Expand
  • table 1
  • table 2
  • table 3
2009
2009
We investigate the integration of C implementation of fast arithmetic operations into Maple, focusing on triangular decomposition… Expand
  • figure 1
  • table 1
  • figure 3
  • table 2
  • figure 4
Highly Cited
2008
Highly Cited
2008
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 2
  • table 1
2003
2003
This paper looks at the development of a Java application programming interface (API) for performing unbounded Polynomial… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Highly Cited
1995
Highly Cited
1995
  • V. Shoup
  • J. Symb. Comput.
  • 1995
  • Corpus ID: 9801847
Abstract We consider the problem of factoring univariate polynomials over a finite field. We demonstrate that the new baby step… Expand
Highly Cited
1993
Highly Cited
1993
introduce the radical inverse function with respect to polynomial arithmetic over finite fields,and thereby construct a… Expand
1989
1989
  • W. Eberly
  • SIAM J. Comput.
  • 1989
  • Corpus ID: 8870926
Parallel algorithms for polynomial arithmetic—multiplication of n polynomials of degree m, polynomial division with remainder… Expand
Highly Cited
1985
Highly Cited
1985
Abstract For univariate polynomials with real or complex coefficients and a given error bound ϵ > 0, h is called a quasi-gcd of f… Expand
Highly Cited
1974
Highly Cited
1974
Sparse polynomial representations are used in a number of algebraic manipulation systems, including Altran. This paper discusses… Expand