Hervé Fournier

45 papers A* 4A 4B 5C 1Journal 28Unranked 3

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