Hervé Fournier

From MaRDI portal
Person:547280

Available identifiers

zbMath Open fournier.herveWikidataQ102366849 ScholiaQ102366849MaRDI QIDQ547280

List of research outcomes





PublicationDate of PublicationType
Towards optimal depth-reductions for algebraic formulas2024-11-19Paper
https://portal.mardi4nfdi.de/entity/Q58756482023-02-03Paper
Balanced And/Or trees and linear threshold functions2019-09-16Paper
https://portal.mardi4nfdi.de/entity/Q53688982017-10-11Paper
Lower bounds for depth-4 formulas computing iterated matrix multiplication2015-10-08Paper
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials2015-09-16Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy2015-07-08Paper
Lower bounds for depth 4 formulas computing iterated matrix multiplication2015-06-26Paper
Computing the Gromov hyperbolicity of a discrete metric space2015-05-21Paper
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant2015-01-30Paper
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant2013-09-20Paper
A deterministic algorithm for fitting a step function to a weighted point-set2013-03-20Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy2012-08-23Paper
The fraction of large random trees representing a given Boolean function in implicational logic2012-05-14Paper
Fitting a step function to a point set2011-07-01Paper
Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns2011-03-30Paper
Tautologies over implication with negative literals2010-08-18Paper
On the shape of decomposable trees2009-12-09Paper
Classical and Intuitionistic Logic Are Asymptotically Identical2009-03-05Paper
Complexity and Limiting Ratio of Boolean Functions over Implication2009-02-03Paper
Fitting a Step Function to a Point Set2008-11-25Paper
Universal relations and {\#}P-completeness2008-11-18Paper
Lower Bounds for Geometric Diameter Problems2008-09-18Paper
On the construction of a family of transversal subspaces over finite fields2008-06-17Paper
A tight lower bound for computing the diameter of a 3D convex polytope2007-11-28Paper
Universal Relations and #P-Completeness2007-05-02Paper
A degree bound on decomposable trees2006-04-28Paper
Vandermonde matrices, NP-completeness and transversal subspaces2004-05-27Paper
Quantifier rank for parity of embedded finite models.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47791592002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45425702002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q27542002001-11-11Paper
Sparse NP-complete problems over the reals with addition2001-08-20Paper

Research outcomes over time

This page was built for person: Hervé Fournier