Symbolic and Algebraic Computation: International Symposium ISSAC' 88, Rome, Italy, July 4-8, 1988. Proceedings: Lecture Notes in Computer Science, cartea 358
Editat de Patrizia Giannien Limba Engleză Paperback – 23 aug 1989
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 345.44 lei
Preț vechi: 431.80 lei
-20% Nou
Puncte Express: 518
Preț estimativ în valută:
66.11€ • 68.20$ • 55.95£
66.11€ • 68.20$ • 55.95£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540510840
ISBN-10: 3540510842
Pagini: 560
Ilustrații: XII, 488 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.78 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540510842
Pagini: 560
Ilustrații: XII, 488 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.78 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Dynamic 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, symmetricpolynomials 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.