Polynomial ring

Known as: Ring of polynomials, Integral polynomial, Free commutative ring 
In mathematics, especially in the field of abstract algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
In this paper we propose an efficient and compact processor for a ring-LWE based encryption scheme. We present three… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a quotient ring of a (non… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
0. Introduction. 1. Let G be a group of linear transformations on a finite dimensional real or complex vector space X. Assume X… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We give a constructive proof of the fact that finitely generated projective modules over a polynomial ring with coefficients in a… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : Rn → R, as well as the… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We formulate a series of conjectures (and a few theorems) on the quotient of the polynomial ring Q[Z1 xn, y1,.. . , yn] in two… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We present an algorithm to compute the primary decomposition of any ideal in a polynomial ring over a factorially closed… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial f e Q[X] in one… (More)
  • figure 1
Is this relevant?