000 06252nam a22005655i 4500
001 978-3-540-46153-1
003 DE-He213
005 20160624102012.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540461531
_9978-3-540-46153-1
024 7 _a10.1007/3-540-51084-2
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT002000
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aSymbolic and Algebraic Computation
_h[electronic resource] :
_bInternational Symposium ISSAC '88 Rome, Italy, July 4–8, 1988 Proceedings /
_cedited by P. Gianni.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aXII, 488 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 ;
_v358
505 0 _aDynamic maintenance of paths and path expressions on graphs -- Generic programming -- From a noncomputability result to new interesting definitions and computability results -- Symbolic derivation and automatic generation of parallel routines for finite element analysis -- Liouvillian first integrals of differential equations -- Fast reduction of the Risch differential equation -- An application of reduce to the approximation of F(X,Y) -- The use of symbolic computation in solving some non-relativistic quantum mechanical problems -- Experiments with quadtree representation of matrices -- Discovering inequality conditions in the analytical solution of optimization problems -- Can EXCALC be used to investigate high-dimensional cosmological models with non-linear Lagrangians? -- Gröbner trace algorithms -- Solving systems of algebraic equations -- Groebner bases in non-commutative algebras -- Greater easy common divisor and standard basis completion algorithms -- Experiments with a projection operator for algebraic decomposition -- Rational Newton algorithm for computing formal solutions of linear differential equations -- An ordinary differential equation solver for REDUCE -- A fixed point method for power series computation -- An algorithm for symbolic computation of center manifolds -- Shortest division chains in imaginary quadratic number fields -- Effective tests for cyclotomic polynomials -- The probability of relative primality of Gaussian integers -- Some computational aspects of root finding in GF(qm) -- Symbolic computation for Witt rings -- Computations with algebraic curves -- On the computational complexity of the resolution of plane curve singularities -- Generalized characteristic polynomials -- Decomposition of algebras -- Algebraic transformations of polynomial equations, symmetric polynomials and elimination -- Tetrahedrizing point sets in three dimensions -- A generalization of the roider method to solve the robot collision problem in 3D -- Symbolic analysis of planar drawings -- A geometrical decision algorithm based on the gröbner bases algorithm -- Solving permutation problems using rewriting systems -- Applying rewriting techniques to groups with power-commutation-presentations -- Efficient decision procedures for locally finite theories II -- Aformal approach to some usually informal techniques used in mathematical reasoning -- Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs -- Computer algebra on MIMD machine -- Algebraic extensions and algebraic closure in Scratchpad II -- Software development for computer algebra or from ALDES/SAC-2 to WEB/Modula-2 -- Cayley, version 4: The user language -- Improved sparse multivariate polynomial interpolation algorithms -- Heuristic methods for operations with algebraic numbers -- Asymptotic estimation of oscillating functions using an interval calculus -- A new algorithm for computing symbolic limits using hierarchical series -- Verification of non-identities in algebras -- Equations in words -- Cayley factorization -- Complexity of computing the characters and the genre of a system of exterior differential equations.
520 _aThe ISSAC'88 is the thirteenth conference in a sequence of international events started in 1966 thanks to the then established ACM Special Interest Group on Symbolic and Algebraic Manipulation (SIGSAM). For the first time the two annual conferences "International Symposium on Symbolic and Algebraic Computation" (ISSAC) and "International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes" (AAECC) have taken place as a Joint Conference in Rome, July 4-8, 1988. Twelve invited papers on subjects of common interest for the two conferences are included in the proceedings and divided between this volume and the preceding volume of Lecture Notes in Computer Science which is devoted to AAECC-6. This book contains contributions on the following topics: Symbolic, Algebraic and Analytical Algorithms, Automatic Theorem Proving, Automatic Programming, Computational Geometry, Problem Representation and Solution, Languages and Systems for Symbolic Computation, Applications to Sciences, Engineering and Education.
650 0 _aComputer science.
650 0 _aCoding theory.
650 0 _aComputer software.
650 0 _aAlgebra
_xData processing.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aCoding and Information Theory.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputation by Abstract Devices.
700 1 _aGianni, P.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540510840
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v358
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-51084-2
942 _2EBK5716
_cEBK
999 _c35010
_d35010