Modern computer algebra
Explore this paper's citation graph
Summary
This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.
- Type
- article
- Published
- 2002-09-01
- Cited by
- 2,135
- References
- 59
- OpenAlex
- https://openalex.org/W1562183207
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:260812341
Keywords
Algebra over a field, Computer science, Mathematics, Pure mathematics
References
- XLIV. On the explicit values of Sturm's quotients
- Arithmetic specializations in polynomials.
- Small Sample Algorithms for the Identification of Polynomials
- Computational and Algorithmic Problems in Finite Fields
- On the equivalence of polynomial GCD and squarefree factorization problems
- Residue arithmetic and its applications to computer technology
- Schnelle Berechnung von Kettenbruchentwicklungen
- Refined Analysis and Improvements on Some Factoring Algorithms
- Chebotarëv and his density theorem
- THE SOLUTION OF THE PROBLEM OF INTEGRATION IN FINITE TERMS
- A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring polynomials over finite fields
- Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)
- XXIII. A method of determining by mere inspection the derivatives from two equations of any degree
- Effective polynomial computation
- Factorization of polynomials over finite fields.
- Ring-Theoretic Properties of Certain Hecke Algebras
- Complexity problems in computational theory
- The JPEG still picture compression standard
Cited by
- Group-by Query Verification by Untrusted Clients on Outsourced Data Streams
- Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis
- Quantum Fourier transforms for extracting hidden linear structures in finite fields
- Polynomial Systems Solving by Fast Linear Algebra
- Computation Sequences for Series and Polynomials
- Development of symbolic algorithms for certain algebraic processes
- Straight-line computation of the polynomial matrix inverse
- Modular absolute decomposition of equidimensional polynomial ideals
- Book List for Algorithms and Data Structures Summer 2008
- Improved Fast Gauss Transform
- Certifying solutions to overdetermined and singular polynomial systems over Q
- Time-space lower bounds for satisfiability and related problems on randomized machines
- On Lattice Methods in Integer Optimization
- Génération automatique de circuits pour le calcul de couplages cryptographiques en matériel
- Irreducibility Certicates for Polynomials with Integer Coecien ts
- On the resultant of degree-deficient polynomials
- Lecture Notes on Computer Algebra
- Algebraic Methods for Geometric Modeling
- Application of Computer Algebra in List Decoding
- Hardware Acceleration Technologies in Computer Algebra: Challenges and Impact
Related papers
- DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATION
- Primärzerlegung in Steinschen Algebren
- Über unirationale Scharen auf algebraischen Mannigfaltigkeiten
- Algebraic Set Operations, Multifunctions, and Indefinite Integrals
- On Almost α(Λ, sp)-continuous Multifunctions
- Produkttreue Klassen universeller Algebren
- Approximation of fixed points of multifunctions in partial metric spaces
- The World of Jagdish N. Srivastava
- Hardy spaces of analytic multifunctions.