• The Journal of Symbolic Computation is a peer-reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic Press...
    2 KB (161 words) - 05:20, 2 May 2024
  • Thumbnail for Computer algebra
    algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software...
    25 KB (3,016 words) - 11:24, 4 July 2024
  • Process Journal of Statistical Software Journal of Strategic Information Systems The Journal of Supercomputing Journal of Symbolic Computation Journal of Systems...
    11 KB (1,012 words) - 21:53, 30 June 2024
  • progressions". Journal of Symbolic Computation. 9 (3): 251–280. doi:10.1016/S0747-7171(08)80013-2. Stothers, Andrew James (2010). On the complexity of matrix...
    34 KB (4,214 words) - 22:27, 1 November 2024
  • Proceedings of International Symposium on Symbolic and Algebraic Computation '85". Springer: 32–33. {{cite journal}}: Cite journal requires |journal= (help)...
    21 KB (2,120 words) - 14:51, 29 July 2024
  • Thumbnail for Bruno Buchberger
    Bruno Buchberger (category Academic staff of Johannes Kepler University Linz)
    University. In 1985 he started the Journal of Symbolic Computation, which has now become the premier publication in the field of computer algebra. Buchberger...
    5 KB (335 words) - 12:49, 7 October 2024
  • Theory and Experiment Journal of Symbolic Computation Journal of Symbolic Logic Journal of the American Mathematical Society Journal of the American Statistical...
    15 KB (1,291 words) - 08:06, 13 July 2024
  • Higher-Order and Symbolic Computation (formerly LISP and Symbolic Computation) was a computer science journal published by Springer Science+Business Media...
    3 KB (169 words) - 16:04, 24 July 2023
  • finding the basis elements of the residue class ring of a zero dimensional polynomial ideal". Journal of Symbolic Computation. 41 (3–4). Translated by Abramson...
    62 KB (9,883 words) - 10:19, 2 November 2024
  • Daniel Lazard (category University of Paris alumni)
    Teo (1993), "Efficient computation of zero-dimensional Gröbner bases by change of ordering", Journal of Symbolic Computation, 16 (4): 329–344, doi:10...
    7 KB (472 words) - 06:36, 27 September 2024