Return to search

A Note on Data Types Supporting Efficient Implementations of Polynomial Arithmetics

There are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:34524
Date15 July 2019
CreatorsApel, Joachim, Klaus, Uwe
PublisherUniversität Leipzig
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, doc-type:book, info:eu-repo/semantics/book, doc-type:Text
SourceReport / Institut für Informatik, Report / Institut für Informatik
Rightsinfo:eu-repo/semantics/openAccess
Relationurn:nbn:de:bsz:15-qucosa2-343029, qucosa:34302

Page generated in 0.0024 seconds