Unique factorization domains in the Java computer algebra system

DOI10.1007/978-3-642-21046-4_5MaRDI QIDQ3003230zbMATH OpenOpenAlexFDO

Authors Heinz Kredel

Publication date 26 May 2011

Published in Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21046-4_5

zbMATH Keywords

greatest common divisorsunique factorization domainmultivariate polynomialsreal roots

Mathematics Subject Classification ID

Theory of programming languages (68N15) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15)

Recommendations

• On a Java computer algebra system, its performance and applications
• Evaluation of a Java Computer Algebra System
• Generic and parallel Groebner bases in JAS (extended abstract)
• Common Divisors of Solvable Polynomials in JAS
• Comprehensive Gröbner bases in a Java computer algebra system

Cited in

(3)

• Common Divisors of Solvable Polynomials in JAS
• On a Java computer algebra system, its performance and applications
• Evaluation of a Java Computer Algebra System

Describes a project that uses

Uses Software

• OOLACA
• JAS
• Orbital library
• jscl-meditor
• ALDOR
• SINGULAR
• SageMath
• AXIOM

This page was built for publication: Unique factorization domains in the Java computer algebra system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003230)