a b c d e f g h i j k l m n o p q r s t u v w x y z    0 1 2 3 4 5 6 7 8 9 
а б в г д е ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я 

Скачать Journal of Symbolic Computation, Vol 1, 1985 бесплатно


Journal of Symbolic Computation, Vol 1, 1985
Academic Press | ISSN: 0747-7171 | 1985 | djvu (ocr) | 3.45 Mb

An international journal, the Journal of Symbolic Computation is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.

It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.

Research Areas Include:

• Computational algebra
• Computational geometry (non-linear)
• Automated theorem proving
• Automatic programming
• Design and implementation of symbolic computation languages and systems
• Applications in education, science, engineering and industry

Volume 1, Number 1, March 1985

* Etienne Paul: Equational Methods in First Order Predicate Calculus. 7-29
* Elmar Eder: Properties of Substitutions and Unifications. 31-46
* Bernard Chazelle, Herbert Edelsbrunner: Optimal Solutions for a Class of Point Retrieval Problems. 47-56
* Erich Kaltofen: Fast Parallel Absolute Irreducibility Testing. 57-67
* Richard Pavelle, Paul S. Wang: MACSYMA from F to G. 69-100
* Vladimir P. Gerdt, A. B. Shvachka, A. Yu. Zharkov: Computer Algebra Application for Classification of Integrable Non-Linear Evolution Equations. 101-107
* K. S. Klbig: Explicit Evaluation of Certain Definite Integrals Involving Powers of Logarithms. 109-114
* Wolfgang Bibel, K. Aspetsberger: A Bibliography on Parallel Inference Machines. 115-118

Volume 1, Number 2, June 1985

* Alan W. Biermann: Automatic Programming: A Tutorial on Formal Methodologies. 119-142
* Gregory Butler: Effective Computation with Group Homomorphisms. 143-157
* David R. Barton, Richard Zippel: Polynomial Decomposition Algorithms. 159-168
* Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa: Decreasing the Nesting Depth of Expressions Involving Square Roots. 169-188
* Richard Zippel: Simplification of Expressions Involving Radicals. 189-210
* John Fitch: Solving Algebraic Problems with Reduce. 211-227
* Fritz Schwarz: An Algorithm for Determining Polynomial First Integrals of Autonomous Systems of Ordinary Differential Equations. 229-233
* Miguel Navarro-Saad, Kurt Bernardo Wolf: Applications of a Factorisation Theorem for Ninth-Order Aberration Optics. 235-239
* Don Coppersmith, James H. Davenport: An Application of Factoring. 241-243

Volume 1, Number 3, September 1985

* Wolfgang Bibel: Automated Inferencing. 245-260
* Daniel Lazard: Ideal Bases and Primary Decomposition: Case of Two Variables. 261-270
* E. V. Krishnamurthy: Symbolic Iterative Algorithm for Generalised Inversion of Rational Polynomial Matrices. 271-281
* Guy W. Cherry: Integration in Finite Terms with Special Functions: the Error Function. 283-302
* Michael Karr: Theory of Summation in Finite Terms. 303-315
* Nicola Rizzi, Amabile Tatone: Using Symbolic Computation in Buckling Analysis. 317-321
* Thierry Coquand, Grard P. Huet: A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction. 323-328

Volume 1, Number 4, December 1985

* Leo Bachmair, David A. Plaisted: Termination Orderings for Associative-Commutative Rewriting Systems. 329-349
* Derek F. Holt: The Mechanical Computation of First and Second Cohomology Groups. 351-361
* Gregory Butler, Clement W. H. Lam: A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects. 363-381
* Klaus Madlener, Friedrich Otto: Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. 383-418
* Ph. Tombal, A. Moussiaux: MACSYMA Computation of the Dirac-Bergmann Algorithm for Hamiltonian Systems with Constraints. 419-421

To see my other books, click here.

No password


Посетители, находящиеся в группе Гости, не могут оставлять комментарии в данной новости.