Hervé Fournier

According to our database, Hervé Fournier authored at least 27 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Towards Optimal Depth-Reductions for Algebraic Formulas.

Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2023

On the Power of Homogeneous Algebraic Formulas.

Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2023

2019

Nonnegative rank measures and monotone algebraic branching programs.

Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2019

2015

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication.

Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan

SIAM J. Comput., 2015

Computing the Gromov hyperbolicity of a discrete metric space.

Hervé Fournier, Anas Ismail, Antoine Vigneron

Inf. Process. Lett., 2015

On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant.

Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos

Inf. Comput., 2015

The shifted partial derivative complexity of Elementary Symmetric Polynomials.

Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2015

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy.

Hervé Fournier, Guillaume Malod, Stefan Mengel

Comput. Complex., 2015

2013

A deterministic algorithm for fitting a step function to a weighted point-set.

Hervé Fournier, Antoine Vigneron

Inf. Process. Lett., 2013

2012

The fraction of large random trees representing a given Boolean function in implicational logic.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Random Struct. Algorithms, 2012

2011

Fitting a Step Function to a Point Set.

Hervé Fournier, Antoine Vigneron

Algorithmica, 2011

Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns.

Hervé Fournier, Olivier Teytaud

Algorithmica, 2011

2010

Tautologies over implication with negative literals.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Math. Log. Q., 2010

2009

On the shape of decomposable trees.

Dominique Barth, Hervé Fournier, Romain Ravaux

Discret. Math., 2009

Balanced And/Or Trees and Linear Threshold Functions.

Hervé Fournier, Danièle Gardy, Antoine Genitrini

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

Universal relations and #P-completeness.

Hervé Fournier, Guillaume Malod

Theor. Comput. Sci., 2008

Lower Bounds for Evolution Strategies Using VC-Dimension.

Olivier Teytaud, Hervé Fournier

Proceedings of the Parallel Problem Solving from Nature, 2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.

Hervé Fournier, Antoine Vigneron

Algorithmica, 2007

Classical and Intuitionistic Logic Are Asymptotically Identical.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

A degree bound on decomposable trees.

Dominique Barth, Hervé Fournier

Discret. Math., 2006

Lower Bounds for Geometric Diameter Problems.

Hervé Fournier, Antoine Vigneron

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2003

Quantifier rank for parity of embedded finite models.

Hervé Fournier

Theor. Comput. Sci., 2003

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces.

Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran

Found. Comput. Math., 2003

2001

Sparse NP-complete problems over the reals with addition.

Hervé Fournier

Theor. Comput. Sci., 2001

2000

Lower Bounds Are Not Easier over the Reals: Inside PH.

Hervé Fournier, Pascal Koiran

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998

Are Lower Bounds Easier over the Reals?

Hervé Fournier, Pascal Koiran

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998