Computational Complexity in Polynomial Algebra

@inproceedings{GRIGOR2010ComputationalCI,
  title={Computational Complexity in Polynomial Algebra},
  author={D. YU. GRIGOR},
  year={2010}
}
  • D. YU. GRIGOR
  • Published 2010
In recent years a number of algorithms have been designed for the "inverse" computational problems of polynomial algebra—factoring polynomials, solving systems of polynomial equations, or systems of polynomial inequalities, and related problems—with running time considerably less than that of the algorithms which were previously known. (For the computational complexity of the "direct" problems such as polynomial multiplication or determination of g.c.d.'s see [1, 16] and also [9].) It should be… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Ein Entscheidungsverfahren für die Theorie der reell- abgeschlossenen Körper

Komplexität von Entscheidungsproblemen 1976 • 1976
View 5 Excerpts
Highly Influenced

A new decision method for elementary algebra

A. Seidenberg
Ann. of Math • 1954
View 4 Excerpts
Highly Influenced

A decision method for elementary algebra and geometry, Univ

A. Tarski
of California Press, Berkeley, Calif., • 1951
View 5 Excerpts
Highly Influenced

Grigor'ev, Finding real solutions of systems of polynomial inequalities in subexponential time

N. N. Vorob'ev, Jr., D. Yu
Soviet Math. Dokl • 1985
View 1 Excerpt

A polynomial algorithm in linear programming , Soviet Math

L. G. Khachian
Dokl . • 1984

Grigor ' ev , Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication , Lecture Notes in Comput

D. Yu.
1984

Similar Papers

Loading similar papers…