default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 38, 2004
Volume 38, Number 1, July 2004
- Arthur D. Chtcherba, Deepak Kapur:
Constructing Sylvester-type resultant matrices using the Dixon formulation. 777-814 - Yong-Bin Li:
Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems. 815-832 - Claus Fieker:
Minimizing representations over number fields. 833-842 - Cristina Blanco, Gabriela Jeronimo, Pablo Solernó:
Computing generators of the ideal of a smooth affine algebraic variety. 843-872 - Claude Marché
, Xavier Urbain:
Modular and incremental proofs of AC-termination. 873-897 - Dongming Wang:
A simple method for implicitizing rational curves and surfaces. 899-914
Volume 38, Number 2, August 2004
- Arthur D. Chtcherba, Deepak Kapur:
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. 915-958 - Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Bernd Sturmfels, Ruriko Yoshida:
Short rational functions for toric algebra and applications. 959-973 - Anne Fredet:
Linear differential equations in exponential extensions. 975-1002 - Lenwood S. Heath, Nicholas A. Loehr:
New algorithms for generating Conway polynomials over finite fields. 1003-1024 - María-Jesús Pisabarro:
Computing lattice ideals of unions of monomial curves. 1025-1042
Volume 38, Number 3, September 2004
- Thomas Cluzeau, Mark van Hoeij:
A modular algorithm for computing the exponential solutions of a linear differential operator. 1043-1076 - Graham Ellis:
Computing group resolutions. 1077-1118 - Haibao Duan, Xuan Zhao, Xuezhi Zhao:
The Cartan matrix and enumerative calculus. 1119-1144 - Clemens Heuberger, Alain Togbé, Volker Ziegler:
Automatic solution of families of Thue equations and an example of degree 8. 1145-1163 - Sergei A. Abramov, Marko Petkovsek:
Erratum to "Rational normal forms and minimal decompositions of hypergeometric terms" [J. Symbolic Comput 33 (2002) 521-543]. 1165
Volume 38, Number 4, October 2004
- Arjeh M. Cohen, Xiao-Shan Gao, Nobuki Takayama:
Editorial. 1167-1168 - Massimo Caboara, Martin Kreuzer, Lorenzo Robbiano:
Efficiently computing minimal sets of critical pairs. 1169-1190 - Anne Frühbis-Krüger:
Partial standard bases as a tool for studying families of singularities. 1191-1205 - Mathias Schulze:
A normal form algorithm for the Brieskorn lattice. 1207-1225 - Masayuki Noro, Kazuhiro Yokoyama:
Implementation of prime decomposition of polynomial ideals over small finite fields. 1227-1246 - Michael Joswig, Günter M. Ziegler:
Convex hulls, oracles, and homology. 1247-1259 - Komei Fukuda:
From the zonotope construction to the Minkowski addition of convex polytopes. 1261-1272 - Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer, Ruriko Yoshida:
Effective lattice point counting in rational convex polytopes. 1273-1302 - Sergei A. Abramov, Jacques Carette, Keith O. Geddes, Ha Q. Le:
Telescoping in the context of symbolic summation in Maple. 1303-1326
Volume 38, Number 5, November 2004
- Lê Tuân Hoa, Eero Hyry:
Castelnuovo-Mumford regularity of initial ideals. 1327-1341 - Thom Mulders:
Certified sparse linear system solving. 1343-1373 - Marco Bozzano, Giorgio Delzanno:
Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols. 1375-1415 - Arnaud Bodin:
Computation of Milnor numbers and critical values at infinity. 1417-1427 - Xavier-François Roblot:
Polynomial factorization algorithms over number fields. 1429-1443 - John J. Cannon, Bettina Eick, Charles R. Leedham-Green:
Special polycyclic generating sequences for finite soluble groups. 1445-1460
Volume 38, Number 6, December 2004
- Shuhong Gao, Erich L. Kaltofen, Alan G. B. Lauder:
Deterministic distinct-degree factorization of polynomials over finite fields. 1461-1470 - Peter Kirschenhofer, Jörg M. Thuswaldner:
Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields. 1471-1486 - Rikard Bøgvad, Thomas Meyer:
On algorithmically checking whether a Hilbert series comes from a complete intersection. 1487-1506 - George E. Collins:
Single-factor coefficient bounds. 1507-1521 - Nicoleta Bila, Jitse Niesen:
On a new procedure for finding nonclassical symmetries. 1523-1533 - Anton Leykin:
Algorithmic proofs of two theorems of Stafford. 1535-1550 - Elisabetta Fortuna, Patrizia M. Gianni, Domenico Luminati:
Algorithmical determination of the topology of a real algebraic surface. 1551-1567
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-21 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
