RO EN
Interfaces to symbolic computation systems: reconsidering experience of Bergman
Authors: Cojocaru Svetlana, Malahov Ludmila, Colesnicov Alexandru
– 0.11 Mb
Abstract
The article is based on experience of implementation of computer algebra system Bergman and on analysis of other symbolic computation systems. It is noted that many symbolic computation systems meet similar interface problems. Necessity of strict separation of calculation engine and interface shell, functions of these components, and requirements to them are motivated. The described approach will be used at future development of Bergman.S. Cojocaru, L. Malahova, A. Colesnicov
Institute of Mathematics and Computer Sciences,
5, Academiei Str.,
Chisinau, MD-2028, Moldova.
E-mail: , ,
Institute of Mathematics and Computer Sciences,
5, Academiei Str.,
Chisinau, MD-2028, Moldova.
E-mail: , ,
Fulltext
– 0.11 Mb
Contents
- Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
- Note about the upper chromatic number of mixed hypertrees
- Nash equilibria sets in mixed extended 2x3 games
- Involving d-Convex Simple and Quasi-simple Planar Graphs in R3
- Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
- Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics
- Approaches to Software Based Fault Tolerance -- A Review
- Interfaces to symbolic computation systems: reconsidering experience of Bergman
