Journal of symbolic computation文章索引

期刊名：Journal of symbolic computation

缩写：J SYMB COMPUT

ISSN：0747-7171

e-ISSN：1095-855X

IF/分区：1.1/Q2

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

Continuously Parameterized Symmetries and Buchberger’s Algorithm [0.03%]

Ralf Hemmecke Ralf Hemmecke

Journal of symbolic computation. 2002;33(1):43-55. DOI:10.1006/jsco.2001.0478 2002

Computing with Quantized Enveloping Algebras: PBW-Type Bases, Highest-Weight Modules andR-Matrices [0.03%]

W.A. de Graaf W.A. de Graaf

Journal of symbolic computation. 2001;32(5):475-490. DOI:10.1006/jsco.2001.0479 2001

Polynomial Minimum Root Separation [0.03%]

George E. Collins George E. Collins

Journal of symbolic computation. 2001;32(5):467-473. DOI:10.1006/jsco.2001.0481 2001

Algorithms for the Gauss–Manin Connection [0.03%]

Mathias Schulze Mathias Schulze

Journal of symbolic computation. 2001;32(5):549-564. DOI:10.1006/jsco.2001.0482 2001

Foreword by the Guest Editors [0.03%]

F.J. Castro-Jiménez; J. Rafael Sendra F.J. Castro-Jiménez; J. Rafael Sendra

Journal of symbolic computation. 2001;32(6):573-574. DOI:10.1006/jsco.2001.0483 2001

Minimal Free Resolutions of HomogenizedD-modules [0.03%]

Toshinori Oaku; Nobuki Takayama Toshinori Oaku; Nobuki Takayama

Journal of symbolic computation. 2001;32(6):575-595. DOI:10.1006/jsco.2001.0484 2001

Computing Homomorphisms Between HolonomicD-modules [0.03%]

Harrison Tsai; Uli Walther Harrison Tsai; Uli Walther

Journal of symbolic computation. 2001;32(6):597-617. DOI:10.1006/jsco.2001.0485 2001

Rank Jumps in Codimension 2A-hypergeometric Systems [0.03%]

Laura Felicia Matusevich Laura Felicia Matusevich

Journal of symbolic computation. 2001;32(6):619-641. DOI:10.1006/jsco.2001.0486 2001

Algorithm for Computing Bernstein–Sato Ideals Associated with a Polynomial Mapping [0.03%]

Rouchdi Bahloul Rouchdi Bahloul

Journal of symbolic computation. 2001;32(6):643-662. DOI:10.1006/jsco.2001.0487 2001

Constructibility of the Set of Polynomials with a Fixed Bernstein–Sato Polynomial: an Algorithmic Approach [0.03%]

Anton Leykin Anton Leykin

Journal of symbolic computation. 2001;32(6):663-675. DOI:10.1006/jsco.2001.0488 2001