- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j12 |      | Hervé Fournier, Antoine Vigneron: A deterministic algorithm for fitting a step function to a weighted point-set. Inf. Process. Lett. 113(3): 51-54 (2013) |
| i4 | | Hervé Fournier, Sylvain Perifel, Rémi de Verclos: On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. CoRR abs/1304.5910 (2013) |
| 2012 | ||
| j11 | | 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): 317-349 (2012) |
| c11 | | Hervé Fournier, Guillaume Malod, Stefan Mengel: Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS 2012: 362-373 |
| i3 | | Hervé Fournier, Anas Ismail, Antoine Vigneron: Computing the Gromov hyperbolicity of a discrete metric space. CoRR abs/1210.3323 (2012) |
| 2011 | ||
| j10 | | Hervé Fournier, Olivier Teytaud: Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3): 387-408 (2011) |
| j9 | | Hervé Fournier, Antoine Vigneron: Fitting a Step Function to a Point Set. Algorithmica 60(1): 95-109 (2011) |
| i2 | | Hervé Fournier, Antoine Vigneron: A deterministic algorithm for fitting a step function to a weighted point-set. CoRR abs/1109.1152 (2011) |
| i1 | | Hervé Fournier, Guillaume Malod, Stefan Mengel: Monomials in arithmetic circuits: Complete problems in the counting hierarchy. CoRR abs/1110.6271 (2011) |
| 2010 | ||
| j8 | | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010) |
| 2009 | ||
| j7 | | Dominique Barth, Hervé Fournier, Romain Ravaux: On the shape of decomposable trees. Discrete Mathematics 309(12): 3882-3887 (2009) |
| c10 | | Hervé Fournier, Danièle Gardy, Antoine Genitrini: Balanced And/Or Trees and Linear Threshold Functions. ANALCO 2009: 51-57 |
| 2008 | ||
| j6 | | Hervé Fournier, Guillaume Malod: Universal relations and #P-completeness. Theor. Comput. Sci. 407(1-3): 97-109 (2008) |
| c9 | | |
| c8 | | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger: Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS 2008: 347-362 |
| c7 | | Olivier Teytaud, Hervé Fournier: Lower Bounds for Evolution Strategies Using VC-Dimension. PPSN 2008: 102-111 |
| 2007 | ||
| j5 | | Hervé Fournier, Antoine Vigneron: A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. Algorithmica 49(3): 245-257 (2007) |
| c6 | | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc: Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193 |
| 2006 | ||
| j4 | | Dominique Barth, Hervé Fournier: A degree bound on decomposable trees. Discrete Mathematics 306(5): 469-477 (2006) |
| c5 | | |
| c4 | | |
| 2003 | ||
| j3 | | Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran: Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. Foundations of Computational Mathematics 3(4): 421-427 (2003) |
| j2 | | Hervé Fournier: Quantifier rank for parity of embedded finite models. Theor. Comput. Sci. 295: 153-169 (2003) |
| 2001 | ||
| j1 | | Hervé Fournier: Sparse NP-complete problems over the reals with addition. Theor. Comput. Sci. 255(1-2): 607-610 (2001) |
| c3 | | |
| 2000 | ||
| c2 | | Hervé Fournier, Pascal Koiran: Lower Bounds Are Not Easier over the Reals: Inside PH. ICALP 2000: 832-843 |
| 1998 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sat May 25 08:32:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page