# Polynomial

## Papers overview

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

Highly Cited

2008

Highly Cited

2008

- ACM Comm. Computer Algebra
- 2008

SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM J. Scientific Computing
- 2002

We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener’s… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- J. Comb. Theory, Ser. B
- 2000

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- STOC
- 1999

We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d ‘Oblivious… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. ACM
- 1998

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed <italic>c</italic> > 1… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Journal of Cryptology
- 1997

We show how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a polynomial in… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- IEEE Trans. Information Theory
- 1988

Two pols nomial time algorithms are given for scheduling conversations in a spread spectrum radio networh. The constraint on… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Information and Control
- 1986

We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point… (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- STOC
- 1984

We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is <italic>O</italic… (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- J. ACM
- 1980

The s tar thng success o f the Rabm-S t ra s sen -So lovay p n m a h t y algori thm, together wi th the intr iguing foundat tonal… (More)

Is this relevant?