On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds

[1]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[2]  Dennis S. Arnon.  Automatic analysis of real algebraic curves , 1981, SIGS.

[3]  Dennis Soule Arnon.  Algorithms for the geometry of semi-algebraic sets , 1981 .

[4]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[5]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  P. J. Kahn,et al.  Counting types of rigid frameworks , 1979 .

[7]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[8]  M. S. Konstantinov,et al.  Robot-manipulator control algorithms: M. B. Ignat'yev, F. M. Kulakov and A. M. Pokrovskii (in Russian). 2nd Edn, Izdatel'stvo Mashinostroenie. Leningrad (1977) , 1979 .

[9]  H. T. Kung,et al.  All Algebraic Functions Can Be Computed Fast , 1978, JACM.

[10]  D. Lazard.  Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination , 1977 .

[11]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[12]  Maurice Mignotte,et al.  Some problems about polynomials , 1976, SYMSAC '76.

[13]  Rüdiger Loos,et al.  Polynomial real root isolation by differentiation , 1976, SYMSAC '76.

[14]  Siegfried M. Rump.  On the sign of a real algebraic number , 1976, SYMSAC '76.

[15]  John D. Lipson.  Newton's method: a great algebraic algorithm , 1976, SYMSAC '76.

[16]  George E. Collins,et al.  Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis , 1976, SIGS.

[17]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[18]  H. Koch.  O.‐H. Keller, Vorlesungen über algebraische Geometrie, 71 Abb. 334 Seiten. Leipzig 1974. Akademische Verlagsgesellschaft Geest & Portig K.‐G. Preis 79,– M , 1975 .

[19]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[20]  H. Hironaka.  Triangulations of algebraic sets , 1974 .

[21]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[22]  B. L. Waerden,et al.  Einführung in die algebraische Geometrie , 1973 .

[23]  R. Moenck.  Studies in fast algebraic algorithms. , 1973 .

[24]  L. E. Heindel.  Integer Arithmetic Algorithms for Polynomial Real Zero Determination , 1971, JACM.

[25]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[26]  Lee E. Heindel,et al.  Integer arithmetic algorithms for polynomial real zero determination , 1971, SYMSAC '71.

[27]  Paul J. Cohen,et al.  Decision procedures for real and p‐adic fields , 1969 .

[28]  William Rowan Hamilton,et al.  Elements of Quaternions , 1969 .

[29]  K. Mahler.  An inequality for the discriminant of a polynomial. , 1964 .

[30]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[31]  W. Rogosinski,et al.  The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.

[32]  H. L. Hime.  “The Elements of Quaternions” , 1894, Nature.