000			05034nam a22004335i 4500
001			978-3-540-35128-3
003			DE-He213
005			20160624101931.0
007			cr nn 008mamaa
008			121227s1979 gw | s |||| 0|eng d
020			_a9783540351283 _9978-3-540-35128-3
024	7		_a10.1007/3-540-09519-5 _2doi
050		4	_aQA75.5-76.95
072		7	_aUY _2bicssc
072		7	_aCOM014000 _2bisacsh
082	0	4	_a004 _223
245	1	0	_aSymbolic and Algebraic Computation _h[electronic resource] : _bEUROSM '79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, France, June 1979 / _cedited by Edward W. Ng.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979.
300			_aXVII, 563 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 ; _v72
505	0		_aA criterion for detecting unnecessary reductions in the construction of Gröbner-bases -- Unification of commutative terms -- Canonicality in rule systems -- The application of symbolic algebra to physics — A case of creeping flow -- Progress towards a solution of the equivalence problem in general relativity -- Symbol calculus by symbolic computation and semi-classical expansions -- An algorithm for the analytic evaluation of a class of integrals -- Fast computation of the rational hermite interpolant and solving toeplitz systems of equations via the extended Euclidean algorithm -- Approximate algorithms to derive exact solutions to systems of linear equations -- New recursive minor expansion algorithms, a presentation in a comparative context -- Systems of algebraic equations -- On the van der waerden criterion for the group of an equation -- Some computations related to torsion points on elliptic curves over number fields -- The computerisation of algebraic geometry -- Algebraic extensions of arbitrary integral domains -- On unit computation in real quadratic fields -- An algebraic form of a solution of a system of linear differential equations with constant coefficients -- Substitution methods for the automatic symbolic solution of differential equations of first order and first degree -- A semi-numeric difference algorithm -- Convergence behaviour of the Newton iteration for first order differential equations -- Probabilistic algorithms for verification of polynomial identities -- Probabilistic algorithms for sparse polynomials -- Non-modular computation of polynomial GCDS using trial division -- Product of symmetric and anti-symmetric polynomials -- Capabilities of the mumath-79 computer algebra system for the intel-8080 microprocessor -- CAMAC 1979 -- The initial design of a vector based algebra system -- Hashing — the key to rapid pattern matching -- A system for automatic generation of tensor algorithms and indicial tensor calculus, including substitution of sums -- Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion -- A cellular decomposition algorithm for semialgebraic sets -- Gamma-algebra algorithms for canonical hypercomplex representations -- Factoring univariate integral polynomials in polynomial average time -- Symbolic-numeric interface: A review -- A note on methods for solving systems of polynomial equations with floating point coefficients -- An arbitrary precision real arithmetic package in REDUCE -- Symbolic preprocessing in interval function computing -- Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation -- Symbolic integration — the dust settles? -- Integration of simple radical extensions -- Algorithms for the integration of algebraic functions -- An extension of liouville's theorem -- Integer matrices and Abelian groups -- An algorithm for the computation of conjugacy classes and centralizers in p-groups -- MODLISP: An introduction -- Extending interlisp for modularization and efficiency -- TLISP — A “transportable-lisp” implemented in pcode -- Symbolic computing with compression of data structures: General observations, and a case study -- On the design of algebraic data structures with the approach of abstract data types -- Matching under commutativity -- ?-algebra algorithms for canonical hypercomplex representations.
650		0	_aComputer science.
650	1	4	_aComputer Science.
650	2	4	_aComputer Science, general.
700	1		_aNg, Edward W. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540095194
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v72
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-09519-5
942			_2EBK4141 _cEBK
999			_c33435 _d33435