Journal of symbolic computation文章索引

期刊名：Journal of symbolic computation

缩写：J SYMB COMPUT

ISSN：0747-7171

e-ISSN：1095-855X

IF/分区：1.1/Q2

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

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms [0.03%]

Christoph M. Hoffman; Andrew Lomonosov; Meera Sitharam Christoph M. Hoffman; Andrew Lomonosov; Meera Sitharam

Journal of symbolic computation. 2001;31(4):409-427. DOI:10.1006/jsco.2000.0403 2001

Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting [0.03%]

Alfred Widiger Alfred Widiger

Journal of symbolic computation. 2001;32(3):291-301. DOI:10.1006/jsco.2000.0404 2001

Divisorial Extensions and the Computation of Integral Closures [0.03%]

Wolmer V. Vasconcelos Wolmer V. Vasconcelos

Journal of symbolic computation. 2000;30(5):595-604. DOI:10.1006/jsco.2000.0405 2000

Computing Transformation Semigroups [0.03%]

S.A Linton; G Pfeiffer; E.F Robertson; N Ruškuc S.A Linton; G Pfeiffer; E.F Robertson; N Ruškuc

Journal of symbolic computation. 2002;33(2):145-162. DOI:10.1006/jsco.2000.0406 2002

Erratum: Special Issue on Symbolic Computation in Algebra, Analysis and Geometry [0.03%]

Journal of symbolic computation. 2000;30(2):237-0. DOI:10.1006/jsco.2000.0408 2000

A Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination [0.03%]

Thom Mulders Thom Mulders

Journal of symbolic computation. 2001;31(4):447-460. DOI:10.1006/jsco.2000.0409 2001

Computing Ideals of Points [0.03%]

J. Abbott; A. Bigatti; M. Kreuzer; L. Robbiano J. Abbott; A. Bigatti; M. Kreuzer; L. Robbiano

Journal of symbolic computation. 2000;30(4):341-356. DOI:10.1006/jsco.2000.0411 2000

Erratum: Algorithms For Exponentation in Finite Fields [0.03%]

Journal of symbolic computation. 2000;30(4):491-0. DOI:10.1006/jsco.2000.0419 2000

On the Practical Solution of Genus Zero Diophantine Equations [0.03%]

Dimitrios Poulakis; Evaggelos Voskos Dimitrios Poulakis; Evaggelos Voskos

Journal of symbolic computation. 2000;30(5):573-582. DOI:10.1006/jsco.2000.0420 2000

(1 + i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm [0.03%]

André Weilert André Weilert

Journal of symbolic computation. 2000;30(5):605-617. DOI:10.1006/jsco.2000.0422 2000