Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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… Expand

Highly Cited

2003

Highly Cited

2003

Let C = F [x1, x2, . . . , xn] be the polynomial ring in the variables x1, x2, . . . , xn over a field F , and let AutC be the… Expand

Highly Cited

2001

Highly Cited

2001

We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb… Expand

Highly Cited

2000

Highly Cited

2000

In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be… Expand

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… Expand

Highly Cited

1993

Highly Cited

1993

This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one… Expand

Highly Cited

1988

Highly Cited

1988

We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a factorially closed… Expand

Highly Cited

1979

Highly Cited

1979

I. Symmetric functions II. Hall polynomials III. HallLittlewood symmetric functions IV. The characters of GLn over a finite field… Expand

Highly Cited

1972

Highly Cited

1972

If k is a field and X and Y are indeterminates then the statement “consider R = Iz[X, Y] as a polynomial ring in one variable” is… Expand

Highly Cited

1963

Highly Cited

1963

Let G be a group of linear transformations on a finite dimensional real or complex vector space X. Assume X is completely… Expand