Pages that link to "Item:Q371190"
From MaRDI portal
The following pages link to Modular composition modulo triangular sets and applications (Q371190):
Displayed 10 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Directed evaluation (Q2192677) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology (Q6081969) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)