+612 9045 4394
 
CHECKOUT
Eurosam 84 : International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9-11, 1984 - John Fitch

Eurosam 84

International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9-11, 1984

By: John Fitch (Editor)

Paperback Published: 1st June 1984
ISBN: 9783540133506
Number Of Pages: 397

Share This Book:

Paperback

$146.95
or 4 easy payments of $36.74 with Learn more
Ships in 5 to 9 business days
Homogeneous linear difference equation (Frobenius - Boole method).- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation.- Operational calculus techniques for solving differential equations.- On the application of symbolic computation to nonlinear control theory.- Quartic equations and algorithms for riemann tensor classification.- Symbolic computation and the Dirichlet problem.- Simplification of polynomials in n variables.- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems.- Implementation of a p-adic package for polynomial factorization and other related operations.- Computations on curves.- Detecting torsion divisors on curves of genus 2.- Computation in radical extensions.- A primer: 11 Keys to new scratchpad.- A pure and really simple initial functional algebraic language.- Some effectivity problems in polynomial ideal theory.- Upper and lower bounds for the degree of Groebner bases.- On the complexity of the Grobner-bases algorithm over K[x,y,z].- Algorithms for computing Grobner bases of polynomial ideals over various Euclidean rings.- Computations with rational subsets of confluent groups.- Camac2: A portable system for combinatorial and algebraic computation.- Polynomial time algorithms for Galois groups.- Code generation and optimization for finite element analysis.- A comparison of algorithms for the symbolic computation of Pade approximants.- Automatic error cumulation control.- Polynomial factorization by root approximation.- Effective Hilbert irreducibility.- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation.- A new lifting process for the multivariate polynomial factorization.- Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11.- On a simple primality testing algorithm.- A criterion for the equivalence of two ideals.- y?+fy=g.- Integration in finite terms with special functions: A progress report.- A note on the Risch differential equation.- Approximation by continued fraction of a polynomial real root.- On the automatic resolution of certain diophantine equations.- On pseudo-resultants.

ISBN: 9783540133506
ISBN-10: 354013350X
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 397
Published: 1st June 1984
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.13
Weight (kg): 0.58

This product is categorised by