Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Fournier, Herv{\'e}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of valiant
Hervé Fournier
,
Sylvain Perifel
,
Rémi de Verclos
Lecture Notes in Computer Science
8087
, 2013, pp. 433-444
A deterministic algorithm for fitting a step function to a weighted point-set
Hervé Fournier
,
Antoine Vigneron
Information Processing Letters
113
(3), 2013, pp. 51-54
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Hervé Fournier
,
Guillaume Malod
,
Stefan Mengel
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 362-373
Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
Hervé Fournier
,
Olivier Teytaud
Algorithmica
59
(3), 2011, pp. 387-408
Fitting a step function to a point set
Hervé Fournier
,
Antoine Vigneron
Algorithmica
60
(1), 2011, pp. 95-109
Complexity and limiting ratio of Boolean functions over implication
Hervé Fournier
,
Danièle Gardy
,
Antoine Genitrini
,
Bernhard Gittenberger
Lecture Notes in Computer Science
5162
, 2008, pp. 347-362
Universal relations and \#P-completeness
Hervé Fournier
,
Guillaume Malod
Theoretical Computer Science
407
(1-3), 2008, pp. 97-109
Fitting a step function to a point set
Hervé Fournier
,
Antoine Vigneron
Lecture Notes in Computer Science
5193
, 2008, pp. 442-453
A tight lower bound for computing the diameter of a 3D convex polytope
Hervé Fournier
,
Antoine Vigneron
Algorithmica
49
(3), 2007, pp. 245-257
Universal relations and
\#P
-completeness
Hervé Fournier
,
Guillaume Malod
Lecture Notes in Computer Science
3998
, 2006, pp. 368-379
Quantifier rank for parity of embedded finite models
Hervé Fournier
Theoretical Computer Science
295
(1-3), 2003, pp. 153-169