Solving algebraic problems with REDUCE (Q1062752): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A review of algebraic manipulative programs and their application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing LISP in a high-level language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Standard LISP report / rank
 
Normal rank
Property / cites work
 
Property / cites work: MACSYMA from F to G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the coefficients of cyclotomic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340137 / rank
 
Normal rank

Revision as of 17:48, 14 June 2024

scientific article
Language Label Description Also known as
English
Solving algebraic problems with REDUCE
scientific article

    Statements

    Solving algebraic problems with REDUCE (English)
    0 references
    0 references
    1985
    0 references
    The algebra system REDUCE is introduced by the exposition of a number of sample problems. While these problems will inevitably be small in scale, and biased towards the interests of the author, the aim is to show how many of the algebraic problems that are faced by scientists and engineers can be readily solved with the powerful tool of computer algebra. No attempt is made to explain the inner workings and design of REDUCE, although there is some reference to the international REDUCE user and implementor community.
    0 references
    computer algebra
    0 references
    0 references
    0 references

    Identifiers