Search the dblp DataBase

Publications of Author

1. Hervé Fournier, Guillaume Malod
   Universal Relations and #P-Completeness. [Citation Graph (0, 0)][DBLP]
   CIAC, 2006, pp:368-379 [Conf]
   
2. Hervé Fournier, Pascal Koiran
   Lower Bounds Are Not Easier over the Reals: Inside PH. [Citation Graph (0, 0)][DBLP]
   ICALP, 2000, pp:832-843 [Conf]
   
3. Hervé Fournier, Antoine Vigneron
   Lower Bounds for Geometric Diameter Problems. [Citation Graph (0, 0)][DBLP]
   LATIN, 2006, pp:467-478 [Conf]
   
4. Hervé Fournier
   Quantifier Rank for Parity of Embedded Finite Models. [Citation Graph (0, 0)][DBLP]
   MFCS, 2001, pp:375-386 [Conf]
   
5. Hervé Fournier, Pascal Koiran
   Are Lower Bounds Easier over the Reals? [Citation Graph (0, 0)][DBLP]
   STOC, 1998, pp:507-513 [Conf]
   
6. Dominique Barth, Hervé Fournier
   A degree bound on decomposable trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:5, pp:469-477 [Journal]
   
7. Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran
   Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. [Citation Graph (0, 0)][DBLP]
   Foundations of Computational Mathematics, 2003, v:3, n:4, pp:421-427 [Journal]
   
8. Hervé Fournier
   Sparse NP-complete problems over the reals with addition. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:255, n:1-2, pp:607-610 [Journal]
   
9. Hervé Fournier
   Quantifier rank for parity of embedded finite models. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:, pp:153-169 [Journal]
   
10. Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
    Classical and Intuitionistic Logic Are Asymptotically Identical. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:177-193 [Conf]
    
11. 
    Fitting a Step Function to a Point Set. [Citation Graph (, )][DBLP]
    
    
12. 
    Complexity and Limiting Ratio of Boolean Functions over Implication. [Citation Graph (, )][DBLP]
    
    
13. 
    Lower Bounds for Evolution Strategies Using VC-Dimension. [Citation Graph (, )][DBLP]
    
    
14. 
    A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. [Citation Graph (, )][DBLP]
    
    
15. 
    On the shape of decomposable trees. [Citation Graph (, )][DBLP]