Paperpal Prime Logo

Journal of Symbolic Computation : Impact Factor & More

eISSN: 1095-855XpISSN: 0747-7171

Aims and Scope of Journal of Symbolic Computation

The Journal of Symbolic Computation is a peer-reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic Press and then by Elsevier. It is targeted to both mathematicians and computer scientists. It was established in 1985 by Bruno Buchberger, who served as its editor until 1994. Less

Key Metrics

CiteScore
2
H-Index
62
Impact Factor
< 5
SJR
Q2Algebra and Number Theory
SNIP
1.57
Recommended pre-submission checks
Powered by Paperpal by Editage

Topics Covered on Journal of Symbolic Computation

Journal of Symbolic Computation Journal Specifications

Indexed in the following public directories

  • Web of Science Web of Science
  • Scopus Scopus
  • Inspec Inspec
  • SJR SJR
Overview
Publisher ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Language English
Frequency Bi-monthly
General Details
LanguageEnglish
FrequencyBi-monthly
Publication Start Year1985
Publisher URLVisit website
Website URLVisit website
View less

Planning to publish in Journal of Symbolic Computation ?

Upload your Manuscript to get

  • Degree of match
  • Common matching concepts
  • Additional journal recommendations
Free Report

Recently Published Papers in Journal of Symbolic Computation

Computational complexity of checking identities in involution monoids of order six or less
  • 1 May 2027
  • Journal of Symbolic Computation
Rational invariants of even degree polynomials under the orthogonal group
  • 1 May 2027
  • Journal of Symbolic Computation
Complete reduction for derivatives in a transcendental Liouvillian extension
  • 1 May 2027
  • Journal of Symbolic Computation
Exploring the unleaved tree of numerical semigroups up to a given genus
  • 1 May 2027
  • Journal of Symbolic Computation
Corrigendum to “A New Algorithm for Gröbner Bases Conversion” [J. Symb. Comput. 128 (2025) 102391
  • 1 May 2027
  • Journal of Symbolic Computation
A new Dixon resultant algorithm for solving parametric polynomial systems using sparse multivariate rational function interpolation
  • 1 May 2027
  • Journal of Symbolic Computation
Computational complexity of checking identities in involution monoids of order six or less
  • 1 May 2027
  • Journal of Symbolic Computation
Rational invariants of even degree polynomials under the orthogonal group
  • 1 May 2027
  • Journal of Symbolic Computation
Complete reduction for derivatives in a transcendental Liouvillian extension
  • 1 May 2027
  • Journal of Symbolic Computation
Exploring the unleaved tree of numerical semigroups up to a given genus
  • 1 May 2027
  • Journal of Symbolic Computation
Corrigendum to “A New Algorithm for Gröbner Bases Conversion” [J. Symb. Comput. 128 (2025) 102391
  • 1 May 2027
  • Journal of Symbolic Computation
A new Dixon resultant algorithm for solving parametric polynomial systems using sparse multivariate rational function interpolation
  • 1 May 2027
  • Journal of Symbolic Computation

FAQs on Journal of Symbolic Computation