Journal of symbolic computation文章索引

期刊名：Journal of symbolic computation

缩写：J SYMB COMPUT

ISSN：0747-7171

e-ISSN：1095-855X

IF/分区：1.1/Q2

共收录本刊相关文章索引2143条

A Sequent Calculus for Automated Reasoning in Symbolic Computation Systems [0.03%]

Gianna Cioni; Attilio Colagrossi; Alfonso Miola Gianna Cioni; Attilio Colagrossi; Alfonso Miola

Journal of symbolic computation. 1995;19(1-3):175-199. DOI:10.1006/jsco.1995.1011 1995

Contexts in Mathematical Reasoning and Computation [0.03%]

William M. Farmer; Joshua D. Guttman; F.Javier Thayer William M. Farmer; Joshua D. Guttman; F.Javier Thayer

Journal of symbolic computation. 1995;19(1-3):201-216. DOI:10.1006/jsco.1995.1012 1995

A Generic Graphic Framework for Combining Inference Tools and Editing Proofs and Formulae [0.03%]

Ricardo Caferra; Michel Herment Lifia-Imag Ricardo Caferra; Michel Herment Lifia-Imag

Journal of symbolic computation. 1995;19(1-3):217-243. DOI:10.1006/jsco.1995.1013 1995

Distributed Deduction by Clause-Diffusion: Distributed Contraction and the Aquarius Prover [0.03%]

Maria Paola Bonacina; Jieh Hsiang Maria Paola Bonacina; Jieh Hsiang

Journal of symbolic computation. 1995;19(1-3):245-267. DOI:10.1006/jsco.1995.1014 1995

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge [0.03%]

A. Dı́az; M. Hitz; E. Kaltofen; A. Lobo; T. Valente A. Dı́az; M. Hitz; E. Kaltofen; A. Lobo; T. Valente

Journal of symbolic computation. 1995;19(1-3):269-282. DOI:10.1006/jsco.1995.1015 1995

Thanks Bruno! (An Editorial) [0.03%]

Bob Caviness Bob Caviness

Journal of symbolic computation. 1995;19(4):283-0. DOI:10.1006/jsco.1995.1016 1995

Computing Bases for Rings of Permutation-invariant Polynomials [0.03%]

Manfred Göbel Manfred Göbel

Journal of symbolic computation. 1995;19(4):285-291. DOI:10.1006/jsco.1995.1017 1995

The Summation of Rational Functions by an Extended Gosper Algorithm [0.03%]

D.E.G. Malm; T.N. Subramaniam D.E.G. Malm; T.N. Subramaniam

Journal of symbolic computation. 1995;19(4):293-304. DOI:10.1006/jsco.1995.1018 1995

A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q) [0.03%]

Alain Poli Alain Poli

Journal of symbolic computation. 1995;19(4):305-319. DOI:10.1006/jsco.1995.1019 1995

Theorem Proving with Ordering and Equality Constrained Clauses [0.03%]

Robert Nieuwenhuis; Albert Rubio Robert Nieuwenhuis; Albert Rubio

Journal of symbolic computation. 1995;19(4):321-351. DOI:10.1006/jsco.1995.1020 1995