default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHervé Fournier
Person information
- affiliation: Université Paris Diderot, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Hervé Fournier, Nutan Limaye
, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. STOC 2024: 141-151- 2023
- [c16]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19 - [i10]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - [i9]Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i8]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023)
2010 – 2019
- 2019
- [c15]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. FSTTCS 2019: 15:1-15:14 - [i7]Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative rank measures and monotone algebraic branching programs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- [j17]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13(1): 1-34 (2017) - 2015
- [j16]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Comput. Complex. 24(1): 1-30 (2015) - [j15]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. Inf. Comput. 240: 31-41 (2015) - [j14]Hervé Fournier, Anas Ismail, Antoine Vigneron:
Computing the Gromov hyperbolicity of a discrete metric space. Inf. Process. Lett. 115(6-8): 576-579 (2015) - [j13]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. 44(5): 1173-1201 (2015) - [c14]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) 2015: 324-335 - [i6]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c13]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC 2014: 128-135 - 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) - [c12]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. MFCS 2013: 433-444 - [i5]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. CoRR abs/1304.5910 (2013) - [i4]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. TR13 (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)
2000 – 2009
- 2009
- [j7]Dominique Barth, Hervé Fournier, Romain Ravaux:
On the shape of decomposable trees. Discret. Math. 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]Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set. ESA 2008: 442-453 - [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. Discret. Math. 306(5): 469-477 (2006) - [c5]Hervé Fournier, Guillaume Malod:
Universal Relations and #P-Completeness. CIAC 2006: 368-379 - [c4]Hervé Fournier, Antoine Vigneron:
Lower Bounds for Geometric Diameter Problems. LATIN 2006: 467-478 - 2003
- [j3]Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran:
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. Found. Comput. Math. 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]Hervé Fournier:
Quantifier Rank for Parity of Embedded Finite Models. MFCS 2001: 375-386 - 2000
- [c2]Hervé Fournier, Pascal Koiran:
Lower Bounds Are Not Easier over the Reals: Inside PH. ICALP 2000: 832-843
1990 – 1999
- 1998
- [c1]Hervé Fournier, Pascal Koiran:
Are Lower Bounds Easier over the Reals? STOC 1998: 507-513
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
