Algorithmic Algebra

[1]  D. Loveland,et al.  Empirical explorations of the geometry-theorem proving machine , 1995 .

[2]  N. Bose.  Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[3]  Richard D. Jenks,et al.  AXIOM: the scientific computation system , 1992 .

[4]  Daniel Lazard,et al.  A Note on Upper Bounds for Ideal-Theoretic Problems , 1992, J. Symb. Comput..

[5]  Daniel Lazard,et al.  Solving Zero-Dimensional Algebraic Systems , 1992, J. Symb. Comput..

[6]  Giovanni Gallo.  Complexity issues in computational algebra , 1992 .

[7]  E. Kunz.  Introduction to commutative algebra and algebraic geometry , 1991, Acta Applicandae Mathematicae.

[8]  Alicia Dickenstein,et al.  The membership problem for unmixed polynomial ideals is solvable in single exponential time , 1991, Discret. Appl. Math..

[9]  Emilio Briales Morales,et al.  Multi-Valued Logic and Gröbner Bases with Applications to Modal Logic , 1991, J. Symb. Comput..

[10]  Giovanni Gallo,et al.  Efficient algorithms and bounds for Wu-Ritt characteristic sets , 1991 .

[11]  Y. N. Lakshman,et al.  On the Complexity of Zero-dimensional Algebraic Systems , 1991 .

[12]  Y. N. Lakshman.  A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals , 1991 .

[13]  Maurice Mignotte,et al.  Mathematics for computer algebra , 1991 .

[14]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[15]  Michael A. Lachance,et al.  An introduction to splines for use in computer graphics and geometric modeling , 1990 .

[16]  Y. N. Lakshman,et al.  On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal , 1990, STOC '90.

[17]  den Essen Arno van.  A criterion to decide if a polynomial map is invertible and to compute the inverse , 1990 .

[18]  Hoon Hong,et al.  Improvements in cad-based quantifier elimination , 1990 .

[19]  J. Risler,et al.  Real algebraic and semi-algebraic sets , 1990 .

[20]  Tomás Recio,et al.  Algorithms in Real Algebraic Geometry and Applications to Computational Geometry , 1990, Discrete and Computational Geometry.

[21]  J. Renegar.  Recent Progress on the Complexity of the Decision Problem for the Reals , 1990, Discrete and Computational Geometry.

[22]  Dexter Kozen,et al.  Parallel Resultant Computation , 1990 .

[23]  Giovanni Gallo,et al.  Wu-Ritt Characteristic Sets and Their Complexity , 1990, Discrete and Computational Geometry.

[24]  Chee-Keng Yap,et al.  Notes on Gröbner bases , 2018, Inf. Sci..

[25]  A. M. W. Glass,et al.  Existence theorems in mathematics , 1989 .

[26]  Lawrence S. Kroll.  Mathematica--A System for Doing Mathematics by Computer. , 1989 .

[27]  B. Su,et al.  Computational geometry: curve and surface modeling , 1989 .

[28]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[29]  Dallas Lankford,et al.  Generalized Gröbner Bases: Theory and Applications. A Condensation , 1989, RTA.

[30]  T. Dubé.  Quantitative analysis of problems in computer algebra: Grobner bases and the Nullstellensatz , 1989 .

[31]  H. Edwards.  Kronecker's Views on the Foundations of Mathematics , 1989 .

[32]  Alkiviadis G. Akritas,et al.  Elements of Computer Algebra with Applications , 1989 .

[33]  Joos Heintz,et al.  Sur la complexité du principe de Tarski-Seidenberg , 1989 .

[34]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[35]  Aristides A. G. Requicha,et al.  Solid modelling—A 1988 update , 1988 .

[36]  Michael Eugene Stillman,et al.  On the Complexity of Computing Syzygies , 1988, J. Symb. Comput..

[37]  Ruth Shtokhamer.  Lifting Canonical Algorithms from a Ring R to the Ring R[x] , 1988, J. Symb. Comput..

[38]  Patrizia M. Gianni,et al.  Gröbner Bases and Primary Decomposition of Polynomial Ideals , 1988, J. Symb. Comput..

[39]  Chee Yap.  A double exponential lower bound for degree-compatible Grobner bases: Technical Report B-88-07 , 1988 .

[40]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[41]  John F. Canny,et al.  Generalized Characteristic Polynomials , 1988, ISSAC.

[42]  André Galligo,et al.  Some New Effectivity Bounds in Computational Geometry , 1988, AAECC.

[43]  Lorenzo Robbiano,et al.  Computer and Commutative Algebra , 1988, AAECC.

[44]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[45]  D. Grigor'ev.  Complexity of deciding Tarski algebra , 1988 .

[46]  James H. Davenport,et al.  Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..

[47]  Dennis S. Arnon,et al.  A Bibliography of Quantifier Elimination for Real Closed Fields , 1988, J. Symb. Comput..

[48]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[49]  Michel Coste,et al.  Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets , 1988, J. Symb. Comput..

[50]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[51]  J. Kollár.  Sharp effective Nullstellensatz , 1988 .

[52]  Friedrich W. Hehl,et al.  Computer Simulation and Computer Algebra: Lectures for Beginners , 1988 .

[53]  James H. Davenport,et al.  Computer Algebra: Systems and Algorithms for Algebraic Computation , 1988 .

[54]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[55]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[56]  W. Brownawell.  Bounds for the degrees in the Nullstellensatz , 1987 .

[57]  B. Barsky,et al.  An Introduction to Splines for Use in Computer Graphics and Geometric Modeling , 1987 .

[58]  Gerhard Rayna,et al.  Reduce - software for algebraic computation , 1987, Symbolic computation: artificial intelligence.

[59]  Giovanni Gallo,et al.  A Procedure to Prove Geometrical Statements , 1987, AAECC.

[60]  F. Richman,et al.  Varieties of Constructive Mathematics: CONSTRUCTIVE ALGEBRA , 1987 .

[61]  H. Edwards.  An Appreciation of Kronecker , 1987 .

[62]  Michael Stillman,et al.  A criterion for detectingm-regularity , 1987 .

[63]  M. Reid,et al.  Commutative ring theory: Regular rings , 1987 .

[64]  M-F Roy,et al.  Géométrie algébrique réelle , 1987 .

[65]  Jiawei Hong,et al.  Proving by example and gap theorems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[66]  Edmond Schonberg,et al.  Programming with Sets: An Introduction to SETL , 1986 .

[67]  Deepak Kapur.  Geometry theorem proving using Hilbert's Nullstellensatz , 1986, SYMSAC '86.

[68]  Sabine Stifter,et al.  Automated geometry theorem proving using Buchberger's algorithm , 1986, SYMSAC '86.

[69]  Lorenzo Robbiano,et al.  On the Theory of Graded Structures , 1986, J. Symb. Comput..

[70]  S. Watt.  Bounded parallelism in computer algebra , 1986 .

[71]  H. M. Möller,et al.  New Constructive Methods in Classical Ideal Theory , 1986 .

[72]  Dung T. Huynh,et al.  A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems , 1986, Inf. Control..

[73]  B. F. Caviness,et al.  Computer Algebra: Past and Future , 1985, J. Symb. Comput..

[74]  Chee Yap,et al.  Admissible orderings and bounds for Grobner bases normal form algorithm: Report 88 , 1986 .

[75]  Bruno Buchberger,et al.  Basic Features and Development of the Critical-Pair/Completion Procedure , 1985, RTA.

[76]  D. Kapur,et al.  An equational approach to theorem proving in first-order predicate calculus , 1985, SOEN.

[77]  Ferdinando Mora,et al.  Groebner Bases for Non-Commutative Polynomial Rings , 1985, AAECC.

[78]  Lorenzo Robbiano,et al.  Term Orderings on the Polynominal Ring , 1985, European Conference on Computer Algebra.

[79]  Joos Heintz,et al.  Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields , 1983, Theor. Comput. Sci..

[80]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[81]  J. Dieudonne,et al.  History Algebraic Geometry , 1985 .

[82]  Luquan Pan.  Applications of rewriting techniques , 1985 .

[83]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[84]  Marc Giusti,et al.  Some Effectivity Problems in Polynomial Ideal Theory , 1984, EUROSAM.

[85]  H. Michael Möller,et al.  Upper and Lower Bounds for the Degree of Groebner Bases , 1984, Symbolic and Algebraic Computation.

[86]  Deepak Kapur,et al.  Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings , 1984, EUROSAM.

[87]  Charles C. Sims,et al.  Abstract algebra: A computational approach , 1984 .

[88]  Richard H. Rand,et al.  Computer algebra in applied mathematics: An introduction to MACSYMA , 1984 .

[89]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

[90]  C. Ayoub.  On constructing bases for ideals in polynomial rings over the integers , 1983 .

[91]  David Masser,et al.  Fields of large transcendence degree generated by values of elliptic functions , 1983 .

[92]  H. Voelcker,et al.  Solid modeling: current status and research directions , 1983, IEEE Computer Graphics and Applications.

[93]  Daniel Lazard,et al.  Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.

[94]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[95]  R. Loos.  Generalized Polynomial Remainder Sequences , 1983 .

[96]  Paul E. Ceruzzi,et al.  Reckoners: The Prehistory of the Digital Computer, from Relays to the Stored Program Concept, 1935–1945 by Paul E. Ceruzzi (review) , 2023 .

[97]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[98]  H. Bass,et al.  The Jacobian conjecture: Reduction of degree and formal expansion of the inverse , 1982 .

[99]  Ferdinando Mora,et al.  An Algorithm to Compute the Equations of Tangent Cones , 1982, EUROCAM.

[100]  D. Bayer.  The division algorithm and the hilbert scheme , 1982 .

[101]  Bruno Buchberger,et al.  Computer algebra symbolic and algebraic computation , 1982, SIGS.

[102]  D. Mumford.  Algebraic Geometry I: Complex Projective Varieties , 1981 .

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

[104]  Daniel Lazard,et al.  Resolution des Systemes d'Equations Algebriques , 1981, Theor. Comput. Sci..

[105]  J. D. Lipson.  Elements of algebra and algebraic computing , 1981 .

[106]  Velma R. Huskey,et al.  Lady Lovelace and Charles Babbage , 1980, Annals of the History of Computing.

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

[108]  Stephen Barnett.  Greatest common divisors from generalized sylvester resultant matrices , 1980 .

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

[110]  Stuart Carl Schaller.  Algorithmic aspects of polynomial residue class rings , 1979 .

[111]  André Galligo,et al.  Théorème de division et stabilité en géométrie analytique locale , 1979 .

[112]  S. Rump.  Polynomial minimum root separation , 1979 .

[113]  W. S. Brown.  The Subresultant PRS Algorithm , 1978, TOMS.

[114]  Robin Hartshorne,et al.  Algebraic geometry , 1977, Graduate texts in mathematics.

[115]  D. A. Spear.  A constructive approach to commutative ring theory , 1977 .

[116]  S. Abhyankar.  Historical Ramblings in Algebraic Geometry and Related Algebra , 1976 .

[117]  Kunio Kakié,et al.  The resultant of several homogeneous polynomials in two indeterminates , 1976 .

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

[119]  Brian Randell,et al.  The origins of digital computers: Selected papers , 1975 .

[120]  John Fitch.  The Cambridge algebra system - An overview , 1975 .

[121]  A. Seidenberg,et al.  What is Noetherian? , 1974 .

[122]  A. Seidenberg.  Constructions in algebra , 1974 .

[123]  Ellis Horowitz,et al.  The minimum root separation of a polynomial , 1974 .

[124]  Fred Richman,et al.  Constructive aspects of Noetherian rings , 1974 .

[125]  A. Galligo.  A propos du théorème de préparation de weierstrass , 1974 .

[126]  R. Jenks.  The SCRATCHPAD language , 1974, SIGPLAN Symposium on Very High Level Languages.

[127]  J. W. Bergquist.  Algebraic manipulation , 1974, APL '74.

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

[129]  H. Goldstine.  The Computer from Pascal to von Neumann , 1973 .

[130]  Horst G. Zimmer,et al.  Computational problems, methods, and results in algebraic number theory , 1972 .

[131]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

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

[133]  W. S. Brown.  On Euclid's algorithm and the computation of polynomial greatest common divisors , 1971, SYMSAC '71.

[134]  George E. Collins.  The SAC-1 system: An introduction and survey , 1971, SYMSAC '71.

[135]  M. D. MacLaren.  The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth) , 1970 .

[136]  Philip J. Davis,et al.  Formac Meets Pappus Some Observations on Elementary Analytic Geometry by Computer , 1969 .

[137]  R. G. Tobey.  Significant problems in symbolic mathematics , 1969 .

[138]  Carl Engelmann.  Mathlab 68 , 1968, IFIP Congress.

[139]  George E. Collins,et al.  Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.

[140]  George E. Collins.  Polynomial Remainder Sequences and Determinants , 1966 .

[141]  George E. Collins.  PM, a system for polynomial manipulation , 1966, CACM.

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

[143]  J. E. Sammet,et al.  Introduction to FORMAC , 1964, IEEE Trans. Electron. Comput..

[144]  H. Hironaka.  Resolution of Singularities of an Algebraic Variety Over a Field of Characteristic Zero: II , 1964 .

[145]  I. Herstein,et al.  Topics in algebra , 1964 .

[146]  William S. Brown,et al.  The alpak system for nonnumerical algebra on a digital computer , 1963 .

[147]  K. Mahler.  An application of Jensen's formula to polynomials , 1960 .

[148]  John F Nolan,et al.  Analytical differentiation on a digital computer , 1953 .

[149]  George Szekeres,et al.  A Canonical Basis for the Ideals of a Polynomial Domain , 1952 .

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

[151]  J. Ritt.  Partial differential algebra , 1950 .

[152]  B. O. Koopman,et al.  On the covering of analytic loci by complexes , 1932 .

[153]  G. Hardy.  A Source Book in Mathematics , 1930, Nature.

[154]  E. Artin,et al.  Algebraische Konstruktion reeller Körper , 1927 .

[155]  F. S. Macaulay,et al.  The Algebraic Theory of Modular Systems , 1972 .

[156]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[157]  W. Burnside,et al.  The Theory of Equations: with an Introduction to the Theory of Binary Algebraic Forms , 2005, Nature.

[158]  D. Hilbert.  Über die Theorie der algebraischen Formen , 1890 .