Functional programming concepts and straight-line programs in computer algebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 992807 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 53680 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 621810 (Why is no real title available?)
- scientific article; zbMATH DE number 1018876 (Why is no real title available?)
- scientific article; zbMATH DE number 1057737 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 1057758 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 797448 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- Algebraic simplification
- Computational methods of linear algebra
- Dagwood
- Definability and fast quantifier elimination in algebraically closed fields
- Deforestation: Transforming programs to eliminate trees
- Deformation techniques for efficient polynomial equation solving.
- Determinant: Old Algorithms, New Insights
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast multiplication of large numbers
- Lower bounds for diophantine approximations
- Monadic parsing in Haskell
- On the time-space complexity of geometric elimination procedures
- Polynomial algorithms in computer algebra
- Probabilistic algorithms for geometric elimination
- Straight-line programs in geometric elimination theory
- The Projective Noether Maple Package: Computing the dimension of a projective variety
Cited in
(7)- A concise proof of the Kronecker polynomial system solver from scratch
- scientific article; zbMATH DE number 63120 (Why is no real title available?)
- Algorithms for Functional Programming
- Towards a library for straight-line programs
- MILONGA
- Note on Algol and conservatively extending functional programming
- scientific article; zbMATH DE number 3846829 (Why is no real title available?)
This page was built for publication: Functional programming concepts and straight-line programs in computer algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849848)