Publications de Fournier :

The fraction of large random trees representing a given boolean function in implicational logic. [Version pdf] H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. Random Structures and Algorithms (RSA), to appear: 2011.

Tautologies over implication with negative literals. H. Fournier, D. Gardy, A. Genitrini, M. Zaionc. Mathematical Logic Quarterly, 56 (4), pp 388-396, 2010. .

Monomials in arithmetic circuits: Complete problems in the counting hierarchy. Hervé Fournier, Guillaume Malod, Stefan Mengel. STACS 2012: 362-373.

On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. Hervé Fournier, Sylvain Perifel, Rémi de Verclos. MFCS 2013: 433-444.