000 03820nam a22004335i 4500
001 978-3-540-38893-7
003 DE-He213
005 20160624101941.0
007 cr nn 008mamaa
008 121227s1984 gw | s |||| 0|eng d
020 _a9783540388937
_9978-3-540-38893-7
024 7 _a10.1007/BFb0032823
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
245 1 0 _aEUROSAM 84
_h[electronic resource] :
_bInternational Symposium on Symbolic and Algebraic Computation Cambridge, England, July 9–11, 1984 /
_cedited by John Fitch.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1984.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1984.
300 _aXI, 397 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v174
505 0 _aHomogeneous 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
700 1 _aFitch, John.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540133506
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v174
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0032823
942 _2EBK4563
_cEBK
999 _c33857
_d33857