EUROSAM 84 [electronic resource] : International Symposium on Symbolic and Algebraic Computation Cambridge, England, July 9–11, 1984 / edited by John Fitch.

Contributor(s): Fitch, John [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 174Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1984Description: XI, 397 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540388937Subject(s): Computer science | Computer Science | Computer Science, generalAdditional physical formats: Printed edition:: No titleDDC classification: 004 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
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 Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner 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 Padé 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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4563

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 Gröbner-bases algorithm over K[x,y,z] -- Algorithms for computing Gröbner 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 Padé 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha