scientific article; zbMATH DE number 1232829

From MaRDI portal
Publication:4223149





The articles of this volume will be reviewed individually. The preceding symposium (1996) has been announced (see Zbl 0903.00075). Indexed articles: \textit{Adamchik, Victor}, A class of logarithmic integrals, 1-8 [Zbl 0922.11114] \textit{Rust, C. J.; Reid, G. J.}, Rankings of partial derivatives, 9-16 [Zbl 0960.12003] \textit{van der Hoeven, Joris}, Lazy multiplication of formal power series, 17-20 [Zbl 0932.68135] \textit{Basu, Saugata}, Uniform quantifier elimination and constraint query processing, 21-27 [Zbl 0915.03031] \textit{Fang, Xin Gui; Havas, George}, On the worst-case complexity of integer Gaussian elimination, 28-31 [Zbl 0916.65038] \textit{Villard, G.}, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. (Extended abstract), 32-39 [Zbl 0917.65041] \textit{von zur Gathen, Joachim; Gerhard, Jürgen}, Fast algorithms for Taylor shifts and certain difference equations. (Extended abstract), 40-47 [Zbl 1005.68996] \textit{Weispfenning, Volker}, Complexity and uniformity of elimination in Presburger arithmetic, 48-53 [Zbl 0915.03032] \textit{de Graaf, W. A.}, Constructing faithful matrix representations of Lie algebras, 54-59 [Zbl 0957.17001] \textit{Zolotykh, Andrej A.}, Tensor product decomposition and other algorithms for representations of large simple Lie algebras, 60-67 [Zbl 0957.17002] \textit{Chistov, Alexander; Ivanyos, Gábor; Karpinski, Marek}, Polynomial time algorithms for modules over finite dimensional algebras, 68-74 [Zbl 0918.16001] \textit{McKay, John; Stauduhar, Richard}, Finding relations among the roots of an irreducible polynomial, 75-77 [Zbl 0942.12002] \textit{Colin, Antoine}, Relative resolvents and partition tables in Galois group computations., 78-84 [Zbl 1113.12300] \textit{Lehobey, Frédéric}, Resolvent computations by resultants without extraneous powers., 85-92 [Zbl 1113.12301] \textit{Kavian, M.; McLenaghan, R. G.; Geddes, K. O.}, Application of genetic algorithms to the algebraic simplification of tensor polynomials, 93-100 [Zbl 0936.53003] \textit{Egner, Sebastian; Püschel, Markus; Beth, Thomas}, Decomposing a permutation into a conjugated tensor product, 101-108 [Zbl 0915.68002] \textit{Storjohann, Arne}, A solution to the extended gcd problem with applications, 109-116 [Zbl 0923.11004] \textit{Stetter, Hans J.}, Stabilization of polynomial system solving with Groebner bases, 117-124 [Zbl 0928.68144] \textit{Beckermann, Bernhard; Cabay, Stan; Labahn, George}, Fraction-free computation of matrix Padé systems, 125-132 [Zbl 0916.65039] \textit{Corless, Robert M.; Gianni, Patrizia M.; Trager, Barry M.}, A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots, 133-140 [Zbl 0917.65048] \textit{Kapur, Deepak; Saxena, Tushar}, Extraneous factors in the Dixon resultant formulation, 141-148 [Zbl 0916.65052] \textit{Abate, Jason; Bischof, Christian; Roh, Lucas; Carle, Alan}, Algorithms and design for a second-order automatic differentiation module, 149-155 [Zbl 0923.68068] \textit{Bronstein, Manuel; Mulders, Thom; Weil, Jacques-Arthur}, On symmetric powers of differential operators, 156-163 [Zbl 0918.13010] \textit{Pflügel, E.}, An algorithm for computing exponential solutions of first order linear differential systems, 164-171 [Zbl 0916.65074] \textit{Abramov, Sergei A.; van Hoeij, Mark}, A method for the integration of solutions to Ore equations, 172-175 [Zbl 0919.34011] \textit{Eberly, Wayne; Kaltofen, Erich}, On randomized Lanczos algorithms, 176-183 [Zbl 0917.65025] \textit{Kaltofen, Erich; Shoup, Victor}, Fast polynomial factorization over high algebraic extensions of finite fields, 184-188 [Zbl 0920.11082] \textit{Emiris, Ioannis Z.; Pan, Victor Y.}, The structure of sparse resultant matrices, 189-196 [Zbl 0916.65046] \textit{Corless, Robert M.; Jeffrey, David J.; Knuth, Donald E.}, A sequence of series for the Lambert \(W\) function, 197-204 [Zbl 0916.65015] \textit{Roach, Kelly}, Meijer \(G\) function representations, 205-211 [Zbl 0918.65013] \textit{Gianni, P.; Trager, B.}, Integral closure of Noetherian rings, 212-216 [Zbl 0927.13012] \textit{Galligo, André; Watt, Stephen}, A numerical absolute primality test for bivariate polynomials, 217-224 [Zbl 0920.11081] \textit{Johnson, J. R.; Krandick, Werner}, Polynomial real root isolation using approximate arithmetic, 225-232 [Zbl 0917.65046] \textit{Reischert, Daniel}, Asymptotically fast computation of subresultants, 233-240 [Zbl 0928.68145] \textit{Dalmas, Stéphane; Gaëtano, Marc; Watt, Stephen}, An OpenMath 1. 0 implementation, 241-248 [Zbl 0923.68069] \textit{Fateman, Richard J.}, Network servers for symbolic mathematics, 249-256 [Zbl 0923.68070] \textit{Monagan, Michael B.; Monagan, Gladys}, A toolbox for program manipulation and efficient code generation with an application to a problem in computer vision, 257-264 [Zbl 0923.68071] \textit{Encarnación, Mark J.}, Factoring polynomials over algebraic fields via norms, 265-270 [Zbl 0924.11101] \textit{Gemignani, Luca}, GCD of polynomials and Bézout matrices, 271-277 [Zbl 0919.65006] \textit{Encarnación, Mark J.}, The average number of modular factors in Trager's polynomial factorization algorithm, 278-281 [Zbl 0919.11065] \textit{Li, Ziming; Nemes, István}, A modular algorithm for computing greatest common right divisors of Ore polynomials, 282-289 [Zbl 0927.16043] \textit{Abramov, Sergei A.; Zima, Eugene}, Minimal completely factorable annihilators, 290-297 [Zbl 0929.16045] \textit{Della Dora, J.; Richard-Jung, F.}, About the Newton algorithm for nonlinear ordinary differential equations, 298-304 [Zbl 0918.65052] \textit{Edneral, Victor F.}, Computer evaluation of cyclicity in planar cubic system, 305-309 [Zbl 0916.65078] \textit{Tsarev, S. P.}, Symbolic manipulation of integrodifferential expressions and factorization of linear ordinary differential operators over transcendental extensions of a differential field, 310-315 [Zbl 0920.68061] \textit{Nussbaum, Doron}, Rectilinear \(p\)-piercing problems, 316-323 [Zbl 0915.68165] \textit{Jeffrey, D. J.; Labahn, G.; von Mohrenschildt, Martin; Rich, A. D.}, Integration of the signum, piecewise and related functions, 324-330 [Zbl 0916.65016] \textit{Li, Qiang; Guo, Yi-ke; Ida, Tetsuo; Darlington, John}, The minimised geometric Buchberger algorithm: An optimal algebraic algorithm for integer programming, 331-338 [Zbl 0926.68038] \textit{Jebelean, Tudor}, Practical integer division with Karatsuba complexity, 339-341 [Zbl 0923.68072] \textit{Fujimura, Masayo; Nishizawa, Kiyoko}, Moduli spaces and symmetry loci of polynomial maps., 342-348 [Zbl 1120.37307] \textit{Andradas, Carlos; Recio, Tomás; Sendra, J. Rafael}, A relatively optimal rational space curve reparametrization algorithm through canonical divisors, 349-355 [Zbl 0918.14023] \textit{Volchek, Emil}, On computing the dual of a plane algebraic curve, 356-358 [Zbl 0920.68062] \textit{Stiller, Peter F.}, Symbolic computation of object/image equations, 359-364 [Zbl 0923.68126] \textit{Zimmer, Horst G.}, SIMATH - a computer algebra system for number theoretic applications. (Survey paper), 365-375 [Zbl 0923.11173] \textit{Dolzmann, Andreas; Sturm, Thomas}, Guarded expressions in practice, 376-383 [Zbl 0923.68073] \textit{Buchberger, Bruno; Jebelean, Tudor; Kriftner, Franz; Marin, Mircea; Tomuţa, Elena; Văsaru, Daniela}, A survey of the \textit{Theorema} project, 384-391 [Zbl 0926.68131] \textit{Cannon, John; Souvignier, Bernd}, On the computation of conjugacy classes in permutation groups, 392-399 [Zbl 0921.20002] \textit{Sims, Charles C.}, Computing with subgroups of automorphism groups of finite groups, 400-403 [Zbl 0922.20026] \textit{Caboara, Massimo; Robbiano, Lorenzo}, Families of ideals in statistics, 404-409 [Zbl 0938.62080]





Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223149)