Hervé Fournier

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 14

Top Topics

Polynomial Size

Matrix Multiplication

Top Venues

Electron. Colloquium Comput. Complex.

Inf. Process. Lett.

Publications

Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Power of Homogeneous Algebraic Formulas. STOC (2024)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR (2023)
Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. (2023)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC (2023)
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. 26 (2019)
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS (2019)
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13 (1) (2017)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. 44 (5) (2015)
Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. Inf. Comput. 240 (2015)
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. 22 (2015)
Hervé Fournier, Anas Ismail, Antoine Vigneron
Computing the Gromov hyperbolicity of a discrete metric space. Inf. Process. Lett. 115 (6-8) (2015)
Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) (2015)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Comput. Complex. 24 (1) (2015)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC (2014)
Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant CoRR (2013)
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. 20 (2013)
Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. MFCS (2013)
Hervé Fournier, Antoine Vigneron
A deterministic algorithm for fitting a step function to a weighted point-set. Inf. Process. Lett. 113 (3) (2013)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40 (3) (2012)
Hervé Fournier, Anas Ismail, Antoine Vigneron
Computing the Gromov hyperbolicity of a discrete metric space CoRR (2012)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS (2012)
Hervé Fournier, Guillaume Malod, Stefan Mengel
Monomials in arithmetic circuits: Complete problems in the counting hierarchy CoRR (2011)
Hervé Fournier, Antoine Vigneron
A deterministic algorithm for fitting a step function to a weighted point-set CoRR (2011)
Hervé Fournier, Antoine Vigneron
Fitting a Step Function to a Point Set. Algorithmica 60 (1) (2011)
Hervé Fournier, Olivier Teytaud
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59 (3) (2011)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
Tautologies over implication with negative literals. Math. Log. Q. 56 (4) (2010)
Dominique Barth, Hervé Fournier, Romain Ravaux
On the shape of decomposable trees. Discret. Math. 309 (12) (2009)
Hervé Fournier, Danièle Gardy, Antoine Genitrini
Balanced And/Or Trees and Linear Threshold Functions. ANALCO (2009)
Hervé Fournier, Antoine Vigneron
Fitting a Step Function to a Point Set. ESA (2008)
Olivier Teytaud, Hervé Fournier
Lower Bounds for Evolution Strategies Using VC-Dimension. PPSN (2008)
Hervé Fournier, Guillaume Malod
Universal relations and #P-completeness. Theor. Comput. Sci. 407 (1-3) (2008)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS (2008)
Hervé Fournier, Antoine Vigneron
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. Algorithmica 49 (3) (2007)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
Classical and Intuitionistic Logic Are Asymptotically Identical. CSL (2007)
Hervé Fournier, Antoine Vigneron
Lower Bounds for Geometric Diameter Problems. LATIN (2006)
Dominique Barth, Hervé Fournier
A degree bound on decomposable trees. Discret. Math. 306 (5) (2006)
Hervé Fournier, Guillaume Malod
Universal Relations and #P-Completeness. CIAC (2006)
Hervé Fournier
Quantifier rank for parity of embedded finite models. Theor. Comput. Sci. 295 (2003)
Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. Found. Comput. Math. 3 (4) (2003)
Hervé Fournier
Sparse NP-complete problems over the reals with addition. Theor. Comput. Sci. 255 (1-2) (2001)
Hervé Fournier
Quantifier Rank for Parity of Embedded Finite Models. MFCS (2001)
Hervé Fournier, Pascal Koiran
Lower Bounds Are Not Easier over the Reals: Inside PH. ICALP (2000)
Hervé Fournier, Pascal Koiran
Are Lower Bounds Easier over the Reals? STOC (1998)