Towards a library for straight-line programs
From MaRDI portal
Cites work
- A concise proof of the Kronecker polynomial system solver from scratch
- A floating-point technique for extending the available precision
- A Gröbner free alternative for polynomial system solving
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- An Interval Step Control for Continuation Methods
- Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
- Arithmetic circuits: a survey of recent results and open questions
- Asymptotic differential algebra and model theory of transseries
- CAMPARY: CUDA multiple precision arithmetic library and applications
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Dagwood
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Fast convolutions meet Montgomery
- Faster arithmetic for number-theoretic transforms
- Faster relaxed multiplication
- FFPACK
- Functional programming concepts and straight-line programs in computer algebra
- scientific article; zbMATH DE number 5344975 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 1262424 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- scientific article; zbMATH DE number 1860706 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- scientific article; zbMATH DE number 865572 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Implementing fast carryless multiplication
- Inter-reciprocity applied to electrical networks
- Introduction to Interval Analysis
- Le rôle des structures de données dans les problèmes d'élimination
- Lower bounds for diophantine approximations
- Modern computer algebra
- Modular SIMD arithmetic in \textsc{Mathemagix}
- MPFR
- On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity
- On the complexity exponent of polynomial system solving
- On the efficiency of effective Nullstellensätze
- On the intrinsic complexity of the arithmetic Nullstellensatz
- Probabilistic algorithms for geometric elimination
- Quasi double-precision in floating point addition
- Relax, but don't be too lazy
- Straight-line programs in geometric elimination theory
- The complexity of partial derivatives
- The Fast Fourier Transform in a Finite Field
- The middle product algorithm. I: Speeding up the division and square root of power series
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- The truncated fourier transform and applications
- The truncated Fourier transform for mixed radices
- Verification methods: rigorous results using floating-point arithmetic
- What can (and can't) we do with sparse polynomials?
This page was built for publication: Towards a library for straight-line programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230642)
