The following pages link to Éric Schost (Q272195):
Displayed 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- (Q486686) (redirect page) (← links)
- A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set (Q705131) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- Computing parametric geometric resolutions (Q1566400) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Algorithms for zero-dimensional ideals using linear recurrent sequences (Q1701497) (← links)
- (Q1773331) (redirect page) (← links)
- Uniform bounds on the number of rational points of a family of curves of genus 2 (Q1773332) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- On the complexity of computing with zero-dimensional triangular sets (Q1930161) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- On the geometry of polar varieties (Q2267371) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Algorithms for Finite Field Arithmetic (Q2819730) (← links)
- A Fast Algorithm for Computing the P-curvature (Q2819740) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- Doing Algebraic Geometry with the RegularChains Library (Q2879164) (← links)