Methodologies of Symbolic Computation

The methodologies of computer algebra are about making algebra (in the broad sense) algorithmic, and efficient as well. There are ingenious algorithms, even in the obvious settings, and also mechanisms where problems are translated into other (generally smaller) settings, solved there, and translated back. Much of the efficiency of modern systems comes from these translations. One of the major challenges is sparsity, and the complexity of algorithms in the sparse setting is often unknown, as many problems are NP-hard, or much worse.

[1]  Bin Li,et al.  Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars , 2008, ISSAC '08.

[2]  M. Sasaki,et al.  Analysis of accuracy decreasing in polynomial remainder sequence with floating-point number coefficients , 1990 .

[3]  James H. Davenport,et al.  The Sparsity Challenges , 2009, 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[4]  Yuval Peres,et al.  Four random permutations conjugated by an adversary generate Sn with high probability , 2014, Random Struct. Algorithms.

[5]  Paul S. Wang.  An improved multivariate polynomial factoring algorithm , 1978 .

[6]  Daniel S. Roche.  What Can (and Can't) we Do with Sparse Polynomials? , 2018, ISSAC.

[7]  Changbo Chen,et al.  Quantifier elimination by cylindrical algebraic decomposition based on regular chains , 2016, J. Symb. Comput..

[8]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[9]  A. Chistov,et al.  Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal , 2009 .

[10]  M. Mignotte.  An inequality about factors of polynomials , 1974 .

[11]  James H. Davenport,et al.  P-adic reconstruction of rational numbers , 1982, SIGS.

[12]  James H. Davenport,et al.  Polynomials whose powers are sparse , 1991 .

[13]  C. L. Dodgson,et al.  IV. Condensation of determinants, being a new and brief method for computing their arithmetical values , 1867, Proceedings of the Royal Society of London.

[14]  Satoshi Yamaguchi,et al.  An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic , 1998, ISSAC '98.

[15]  Kiyoshi Shirayanagi.  Floating point Gro¨bner bases , 1996 .

[16]  Matthew England,et al.  The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree , 2016, CASC.

[17]  David R. Musser,et al.  On the Efficiency of a Polynomial Irreducibility Test , 1978, JACM.

[18]  John Abbott,et al.  Bounds on factors in Z[x] , 2009, J. Symb. Comput..

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

[20]  Elizabeth A. Arnold,et al.  Modular algorithms for computing Gröbner bases , 2003, J. Symb. Comput..

[21]  David A. Cox.  Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First , 2011, Am. Math. Mon..

[22]  A. Schinzel.  A Panorama in Number Theory or The View from Baker's Garden: On the Greatest Common Divisor of Two Univariate Polynomials, I , 2002 .

[23]  Damien Stehlé,et al.  An LLL Algorithm with Quadratic Complexity , 2009, SIAM J. Comput..

[24]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[25]  E. Bareiss.  Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[26]  James H. Davenport,et al.  Benchmarking Solvers, SAT-style , 2017, SC²@ISSAC.

[27]  W. S. Brown,et al.  On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.

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

[29]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[30]  Michael Kalkbrener,et al.  A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..

[31]  David A. Plaisted.  Some Polynomial and Integer Divisibility problems are NP-Hard , 1978, SIAM J. Comput..

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

[33]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[34]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[35]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[36]  Ernst W. Mayr,et al.  Dimension-dependent bounds for Gröbner bases of polynomial ideals , 2013, J. Symb. Comput..

[37]  E. Berlekamp.  Factoring polynomials over finite fields , 1967 .