Modular composition modulo triangular sets and applications
From MaRDI portal
Publication:371190
DOI10.1007/s00037-013-0063-yzbMath1311.68199OpenAlexW1985813832MaRDI QIDQ371190
Publication date: 30 September 2013
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-013-0063-y
Related Items (10)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Directed evaluation ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Fast computation of generic bivariate resultants ⋮ Computing Puiseux series: a fast divide and conquer algorithm ⋮ Accelerated tower arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homotopy techniques for multiplication modulo triangular sets
- Functional decomposition of polynomials: the tame case
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Matrix multiplication via arithmetic progressions
- Fast arithmetic for triangular sets: from theory to practice
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Fast rectangular matrix multiplication and applications
- Solving zero-dimensional systems through the rational univariate representation
- Simple multivariate polynomial multiplication
- Straight-line programs in geometric elimination theory
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- On the theories of triangular sets
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
- Complexity results for triangular sets
- Computing Frobenius maps and factoring polynomials
- Fast computation of special resultants
- PARDI!
- Change of order for bivariate triangular sets
- Fast Polynomial Factorization and Modular Composition
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Greatest common divisors of polynomials given by straight-line programs
- Fast Algorithms for Manipulating Formal Power Series
- Multiplying matrices faster than coppersmith-winograd
- Fast construction of irreducible polynomials over finite fields
- A Gröbner free alternative for polynomial system solving
This page was built for publication: Modular composition modulo triangular sets and applications
