000 03472nam a22004575i 4500
001 978-3-540-38756-5
003 DE-He213
005 20160624101941.0
007 cr nn 008mamaa
008 121227s1983 gw | s |||| 0|eng d
020 _a9783540387565
_9978-3-540-38756-5
024 7 _a10.1007/3-540-12868-9
_2doi
050 4 _aQA297-299.4
072 7 _aPBKS
_2bicssc
072 7 _aMAT021000
_2bisacsh
072 7 _aMAT006000
_2bisacsh
082 0 4 _a518
_223
245 1 0 _aComputer Algebra
_h[electronic resource] :
_bEUROCAL'83, European Computer Algebra Conference London, England, March 28–30, 1983 Proceedings /
_cedited by J. A. Hulzen.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1983.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1983.
300 _aXIII, 306 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 ;
_v162
505 0 _aIntegration — What do we want from the theory? -- The Euclidean algorithm for Gaussian integers -- Multi polynomial remainder sequence and its application to linear diophantine equations -- Towards mechanical solution of the Kahan ellipse problem I -- Automatically determining symmetries of ordinary differential equations -- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations -- Characterization of a linear differential system with a regular singularity -- The Bath Concurrent LISP machine -- The ecology of LISP or the case for the preservation of the environment -- The design of Maple: A compact, portable, and powerful computer algebra system -- LISP compilation viewed as provable semantics preserving program transformation -- Implementing REDUCE on a microcomputer -- A note on the complexity of constructing Gröbner-bases -- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations -- The computation of the Hilbert function -- An algorithm for constructing detaching bases in the ring of polynomials over a field -- On the problem of Beh? Edd?n 'Am?l? and the computation of height functions -- A procedure for determining algebraic integers of given norm -- Computation of integral solutions of a special type of systems of quadratic equations -- Factorisation of sparse polynomials -- Early detection of true factors in univariate polynomial factorization -- On the complexity of finding short vectors in integer lattices -- Factoring polynomials over algebraic number fields -- The construction of a complete minimal set of contextual normal forms -- A knowledge-based approach to user-friendliness in symbolic computing -- Computer algebra and VLSI, prospects for cross fertilization -- Code optimization of multivariate polynomial schemes: A pragmatic approach.
650 0 _aMathematics.
650 0 _aNumerical analysis.
650 1 4 _aMathematics.
650 2 4 _aNumerical Analysis.
700 1 _aHulzen, J. A.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540128687
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v162
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-12868-9
942 _2EBK4536
_cEBK
999 _c33830
_d33830