Modular composition modulo triangular sets and applications
From MaRDI portal
Publication:371190
DOI10.1007/S00037-013-0063-YzbMATH Open1311.68199OpenAlexW1985813832MaRDI QIDQ371190FDOQ371190
Authors: Adrien Poteaux, Éric Schost 
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
Recommendations
Cites Work
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiplying matrices faster than coppersmith-winograd
- Matrix multiplication via arithmetic progressions
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- PARDI!
- Change of order for bivariate triangular sets
- Title not available (Why is that?)
- Fast polynomial factorization and modular composition
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Gröbner free alternative for polynomial system solving
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On the theories of triangular sets
- Title not available (Why is that?)
- Fast computation of special resultants
- Title not available (Why is that?)
- Modern computer algebra
- Fast arithmetic for triangular sets: from theory to practice
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Fast rectangular matrix multiplication and applications
- Simple multivariate polynomial multiplication
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
- Complexity results for triangular sets
- Computing Frobenius maps and factoring polynomials
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On the complexity of the D5 principle
- Greatest common divisors of polynomials given by straight-line programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts
- Title not available (Why is that?)
- Fast construction of irreducible polynomials over finite fields
- Homotopy techniques for multiplication modulo triangular sets
- Functional decomposition of polynomials: the tame case
Cited In (15)
- Accelerated tower arithmetic
- Fast computation of generic bivariate resultants
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Computing isomorphisms and embeddings of finite fields
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Modular composition via factorization
- Bivariate polynomial reduction and elimination ideal over finite fields
- Composition modulo powers of polynomials
- Elimination ideal and bivariate resultant over finite fields
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- Directed evaluation
- Computing Puiseux series: a fast divide and conquer algorithm
- Homotopy techniques for multiplication modulo triangular sets
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
- Univariate polynomial factorization over finite fields with large extension degree
Uses Software
This page was built for publication: Modular composition modulo triangular sets and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371190)
