# Polynomial ring

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- CHES
- 2014

In this paper we propose an efficient and compact processor for a ring-LWE based encryption scheme. We present threeâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- J. Symb. Comput.
- 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

- 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

- 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

- SIAM Journal on Optimization
- 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

- ANTS
- 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

- 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

- 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

- J. Symb. Comput.
- 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

- 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)

Is this relevant?