Modular composition modulo triangular sets and applications

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A complete algorithm for automated discovering of a class of inequality-type theorems
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
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
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
Fast computation of special resultants
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
Greatest common divisors of polynomials given by straight-line programs
Fast construction of irreducible polynomials over finite fields
Homotopy techniques for multiplication modulo triangular sets
Functional decomposition of polynomials: the tame case

Cited In (12)

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
Bivariate polynomial reduction and elimination ideal over finite fields
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
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

Kronecker
DISCOVERER
ISOLATE

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)