Journal of Symbolic Computation

Aims & Scope

An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation.

The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.

It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas.

It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation.

To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.1
2024	0.60

Journal Rank

Year	Value
2024	10903

Journal Citation Indicator

Year	Value
2024	248

SJR (SCImago Journal Rank)

Year	Value
2024	0.533

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	66

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• The Magma Algebra System I: The User Language

  Citation: 4406

  Authors: WIEB, JOHN, CATHERINE

• Matrix multiplication via arithmetic progressions

  Citation: 1346

  Authors: Don, Shmuel

• Eigenvalues of a real supersymmetric tensor

  Citation: 1064

  Authors: Liqun

• Practical graph isomorphism, II

  Citation: 742

  Authors: Brendan D., Adolfo

• Termination of rewriting

  Citation: 500

  Authors: Nachum

• Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering

  Citation: 405

  Authors: J.C., P., D., T.

• Partial Cylindrical Algebraic Decomposition for quantifier elimination

  Citation: 399

  Authors: George E., Hoon

• On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

  Citation: 337

  Authors: James

• A Structure-preserving Clause Form Translation

  Citation: 335

  Authors: David A., Steven

• Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

  Citation: 328

  Authors: Bruno

---