ISSAC 1996: Zurich, Switzerland
Erwin Engeler, B. F. Caviness, Yagati N. Lakshman (Eds.): Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996. ACM 1996 ISBN 0-89791-796-0- Joachim von zur Gathen, Jürgen Gerhard: Arithmetic and Factorization of Polynomial Over F2 (extended abstract). 1-9
- Marie-Françoise Roy, Nicolai Vorobjov: Computing the Complexification of a Semi-Algebraic Set. 26-34
- Narendra Karmarkar, Yagati N. Lakshman: Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. 35-39
- Loic Pottier: The Euclidean Algorithm in Dimension n. 40-42
- Franz Binder: Fast Computations in the Lattice of Polynomial Rational Function Fields. 43-48
- Dima Grigoriev: Testing Shift-Equivalence of Polynomials Using Quantum Machines. 49-54
- Ulla Koppenhagen, Ernst W. Mayr: An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. 55-62
- Massimo Caboara, Gabriel de Dominicis, Lorenzo Robbiano: Multigraded Hilbert Functions and Buchberger Algorithm. 72-78
- Hoon Hong: Groebner Basis Under Composition II. 79-85
- Richard J. Fateman: Symbolic Mathematics System Evaluators (extended abstract). 86-94
- Beatrice Amrhein, Oliver Gloor, Wolfgang Küchlin: A Case Study of Multi-Threaded Gröbner Basis Completion. 95-102
- Olaf Bachmann, Hans Schönemann, Simon Gray: MPP: A Framework for Distributed Polynomial Computations. 103-112
- Daniel Richardson: Solution of Elementary Systems of Equations in a Box in Rn. 120-126
- Hans J. Stetter: Analysis of Zero Clusters in Multivariate Polynomial Systems. 127-136
- George E. Collins, Werner Krandick: A Tangent-Secant Method for Polynomial Complex Root Calculation. 137-141
- Timm Ahrendt: Fast High-Precision Computation of Complex Square Roots. 142-149
- Andreas Thümmel: Computing Character Tables of p-Groups. 150-154
- Gene Cooperman, Michael Tselman: New Sequential and Parallel Algorithms for Generating High Dimension Hecke Algebras Using the Condensation Technique. 155-160
- Alexander A. Mikhalev, Andrej A. Zolotykh: Algorithms for Primitive Elements of Free Lie Algebras and Lie Superalgebras. 161-169
- Fritz Schwarz: Janet Bases of 2nd Order Ordinary Differential Equations. 179-188
- Evelyne Hubert: The General Solution of an Ordinary Differential Equation. 189-195
- G. Thomas: Symbolic Computation of the Index of Quasilinear Differential-Algebraic Equations. 196-203
- Masoud Kavian, R. G. McLenaghan, Keith O. Geddes: MapleTensor: Progress Report on a New System for Performing Indicial and Component Tensor Calculations Using Symbolic Computation. 204-211
- Mark van Hoeij: Rational Solutions of the Mixed Differential Equation and Its Application to Factorization of Differential Operators. 219-225
- Serguei P. Tsarev: An Algorithm for Complete Enumeration of all Factorizations of a Linear Ordinary Differential Operator. 226-231
- Sergei A. Abramov, Eugene V. Zima: D'Alembertian Solutions of Inhomogeneous Linear Equations (differential, difference, and some other). 232-240
- Gilles Villard: Computing Popov and Hermite Forms of Polynomial Matrices. 250-258
- Arne Storjohann, George Labahn: Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. 259-266
- Arne Storjohann: Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices. 267-274
- Úlfar Erlingsson, Erich Kaltofen, David R. Musser: Generic Gram-Schmidt Orthogonalization by Exact Division. 275-282
- Rainer Bacher: Automatic Generation of Optimization Code Based on Symbolic Non-Linear Domain Formulation. 283-291
- Yanjie Zhao, Tetsuya Sakurai, Hiroshi Sugiura, Tatsuo Torii: A Methodology of Parsing Mathematical Notation for Mathematical Computation. 292-300
- Kelly Roach: Hypergeometric Function Representations. 301-308
- Daniel Richardson, Bruno Salvy, John Shackell, Joris van der Hoeven: Asymptotic Expansions of exp-log Functions. 309-313
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team