Skip to search formSkip to main contentSkip to account menu

Polynomial arithmetic

Polynomial arithmetic is a branch of algebra dealing with some properties of polynomials which share strong analogies with properties of number… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Empowering electronic devices to support Post-Quantum Cryptography (PQC) is a challenging task. PQC introduces new mathematical… 
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… 
2013
2013
2009
2009
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields… 
Highly Cited
2008
Highly Cited
2008
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of… 
2003
2003
This paper looks at the development of a Java application programming interface (API) for performing unbounded Polynomial… 
Highly Cited
1993
Highly Cited
1993
introduce the radical inverse function with respect to polynomial arithmetic over finite fields,and thereby construct a… 
1993
1993
  • M. Monagan
  • Design and Implementation of Symbolic Computation…
  • 1993
  • Corpus ID: 18616453
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to… 
Highly Cited
1985
Highly Cited
1985
Highly Cited
1974
Highly Cited
1974
Sparse polynomial representations are used in a number of algebraic manipulation systems, including Altran. This paper discusses…