ÉS
Éric Schost
cs.SCmath.AGcs.CCmath.NTmath.ACcs.DScs.ITcs.MSmath.COmath.IT
On Valency
published · living versionsW_v357jkqr·v1 · currentpublished
Some algebraic and geometric computations in CH via Chow forms
with Robert Andrews, Abhibhav Garg, Rafael Oliveira
1 version
Preprints & journals
62 papers in the corpus · 2006–2026Fast Deterministic Normal Bases and Circulant Polynomial Determinants2607.00313v2 · Mark Giesbrecht, Armin Jamshidpey, 'Eric Schost2026 · 0 citationsarXiv
Primes of bad reduction for systems of polynomial equations2603.02279v1 · Jesse Elliott, 'Eric Schost2026 · 0 citationsarXiv
Hilbert's Nullstellensatz is in the Counting Hierarchy2602.17904v1 · Robert Andrews, Abhibhav Garg, 'Eric Schost2026 · 0 citationsarXiv
Faster modular composition using two relation matrices2601.17422v2 · Vincent Neiger, Bruno Salvy, 'Eric Schost et al.2026 · 0 citationsarXiv
Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set2508.20607v2 · Jesse Elliott, Mark Giesbrecht, Edern Gillot (PolSys) et al.2025 · 0 citationsJournal of Symbolic Computation, 2026, 138
A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case2504.09790v1 · Benjamin Hackl, Andrew Luo, Stephen Melczer et al.2025 · 0 citationsarXiv
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity2402.03111v2 · R'emi Pr'ebet, Mohab Safey El Din, 'Eric Schost2024 · 0 citationsarXiv
-adic algorithm for bivariate Gröbner bases2312.14116v1 · Eric Schost, Catherine St-Pierre2023 · 6 citationsISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic ComputationJuly 2023
Faster real root decision algorithm for symmetric polynomials2306.03855v1 · George Labahn, Cordian Riener, Mohab Safey El Din et al.2023 · 2 citationsarXiv
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology2302.08611v1 · Yossef Musleh, 'Eric Schost2023 · 3 citationsarXiv
Newton iteration for lexicographic Gröbner bases in two variables2302.03766v1 · 'Eric Schost, Catherine St-Pierre2023 · 5 citationsarXiv
Bit complexity for computing one point in each connected component of a smooth real algebraic set2207.04289v1 · Jesse Elliott, Mark Giesbrecht, Eric Schost2022 · 4 citationsarXiv
Computing roadmaps in unbounded smooth real algebraic sets I: connectivity results2203.03961v2 · R'emi Pr'ebet (PolSys), Mohab Safey El Din (PolSys), 'Eric Schost2022 · 3 citationsarXiv
Faster Modular Composition2110.08354v2 · Vincent Neiger, Bruno Salvy, 'Eric Schost et al.2021 · 6 citationsarXiv
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials2102.03583v2 · Seung Gyu Hyun, Vincent Neiger, 'Eric Schost2021 · 3 citationsarXiv
Connectivity in Semi-Algebraic Sets I2011.02162v2 · Hoon Hong, James Rohal, Mohab Safey El Din et al.2020 · 0 citationsarXiv
Homotopy techniques for solving sparse column support determinantal polynomial systems2009.00844v1 · George Labahn (SCG), Mohab Safey El Din (PolSys), 'Eric Schost (SCG) et al.2020 · 8 citationsarXiv
Computing critical points for invariant algebraic systems2009.00847v1 · Jean-Charles Faugere (PolSys), George Labahn (SCG), Mohab Safey El Din (PolSys) et al.2020 · 11 citationsarXiv
Subquadratic-Time Algorithms for Normal Bases2005.03497v2 · Mark Giesbrecht, Armin Jamshidpey, 'Eric Schost2020 · 2 citationsarXiv
Computing syzygies in finite dimension using fast linear algebra1912.01848v2 · Vincent Neiger, 'Eric Schost2019 · 18 citationsarXiv
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module1907.12731v1 · Yossef Musleh, 'Eric Schost2019 · 5 citationsarXiv
Change of basis for m-primary ideals in one and two variables1905.04614v1 · Seung Gyu Hyun, Stephen Melczer, 'Eric Schost et al.2019 · 7 citationsarXiv
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants1905.04356v1 · Seung Gyu Hyun, Vincent Neiger, 'Eric Schost2019 · 8 citationsarXiv
Quadratic Probabilistic Algorithms for Normal Bases1903.03278v1 · Mark Giesbrecht, Armin Jamshidpey, 'Eric Schost2019 · 0 citationsarXiv
Solving determinantal systems using homotopy techniques1802.10409v1 · Jonathan D. Hauenstein, Mohab Safey El Din (PolSys), 'Eric Schost (CS) et al.2018 · 10 citationsarXiv
Algebraic Construction of Quasi-split Algebraic Tori1801.09629v1 · Armin Jamshidpey, Nicole Lemire, Eric Schost2018 · 2 citationsarXiv
Block-Krylov techniques in the context of sparse-FGLM algorithms1712.04177v2 · Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy et al.2017 · 6 citationsarXiv
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields1712.00669v2 · Javad Doliskani, Anand Kumar Narayanan, 'Eric Schost2017 · 5 citationsarXiv
Algorithms for zero-dimensional ideals using linear recurrent sequences1707.01971v1 · Vincent Neiger, Hamid Rahkooy, 'Eric Schost2017 · 4 citationsarXiv
Fast Computation of the Roots of Polynomials Over the Ring of Power Series1705.10658v1 · Vincent Neiger, Johan Rosenkilde, Eric Schost2017 · 18 citationsarXiv
Computing isomorphisms and embeddings of finite fields1705.01221v1 · Ludovic Brieulle, Luca De Feo, Javad Doliskani et al.2017 · 9 citationsarXiv
On matrices with displacement structure: generalized operators and faster algorithms1703.03734v1 · Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron et al.2017 · 19 citationsarXiv
A Fast Algorithm for Computing the Truncated Resultant1609.04259v1 · Guillaume Moroz (VEGAS), 'Eric Schost2016 · 12 citationsISSAC '16, Jul 2016, Waterloo, Canada. ACM, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp.341-348, 2016
On semiring complexity of Schur polynomials1608.05043v2 · Sergey Fomin, Dima Grigoriev, Dorian Nogneng et al.2016 · 2 citationsarXiv
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization1605.07433v2 · Mohab Safey El Din, Eric Schost ( PolSys, CS)2016 · 5 citationsarXiv
Computation of the Similarity Class of the p-Curvature1605.06126v1 · Alin Bostan, Xavier Caruso, Eric Schost2016 · 9 citationsarXiv
Explicit isogenies in quadratic time in any characteristic1603.00711v2 · Luca De Feo, Cyril Hugounenq, J'erome Plut et al.2016 · 12 citationsLMS J. Comput. Math. 19 (2016) 267-282
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts1602.00651v2 · Claude-Pierre Jeannerod, Vincent Neiger, Eric Schost et al.2016 · 28 citationsarXiv
Computing minimal interpolation bases1512.03503v2 · Claude-Pierre Jeannerod, Vincent Neiger, 'Eric Schost et al.2015 · 30 citationsarXiv
A Fast Algorithm for Computing the p-Curvature1506.05645v1 · Alin Bostan (SPECFUN), Xavier Caruso (IRMAR), 'Eric Schost2015 · 12 citationsarXiv
A fast algorithm for computing the characteristic polynomial of the p-curvature1405.5341v1 · Alin Bostan, Xavier Caruso (IRMAR), 'Eric Schost2014 · 18 citationsarXiv
Faster Algorithms for Multivariate Interpolation with Multiplicities and Simultaneous Polynomial Approximations1402.0643v2 · Muhammad F. I. Chowdhury (ORCCA), Claude-Pierre Jeannerod, Vincent Neiger et al.2014 · 34 citationsarXiv
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation1312.7279v2 · 'Eric Schost, Pierre-Jean Spaenlehauer2013 · 27 citationsarXiv
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets1307.7836v3 · Mohab Safey El Din (LIP6, PolSys), Eric Schost2013 · 80 citationsarXiv
Fast algorithms for ell-adic towers over finite fields1301.6021v1 · Luca De Feo, Javad Doliskani, 'Eric Schost2013 · 10 citationsarXiv
A simple and fast algorithm for computing exponentials of power series1301.5804v1 · Alin Bostan, Eric Schost2013 · 9 citationsInformation Processing Letters 109, 13 (2009) 754-756
Analytical solution of the tooling/workpiece contact interface shape during a flow forming operation1206.2547v1 · M. J. Roy, D. M. Maijer, R. J. Klassen et al.2012 · 30 citationsJournal of Materials Processing Technology 210, 14 (2010) 1976-1985
Power Series Solutions of Singular (q)-Differential Equations1205.3414v1 · Alin Bostan, Muhammad F. I. Chowdhury, Romain Lebreton et al.2012 · 7 citationsProceedings ISSAC'12, pages 107-114, 2012
A baby step-giant step roadmap algorithm for general algebraic sets1201.6439v2 · Saugata Basu, Marie-Francoise Roy, Mohab Safey El Din et al.2012 · 45 citationsarXiv
Taking Roots over High Extensions of Finite Fields1110.4350v1 · Javad Doliskani, Eric Schost2011 · 15 citationsarXiv
Career total: 203 works. 62 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.