Hervé Fournier
Research Subjects
Hervé Fournier has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Antoine Vigneron
UNIST, Sch Elect & Comp Engn, Ulsan, South Korea
2 shared publications - Danièle Gardy
David Laboratory, Université de Versailles Saint-Quentin-en-Yvelines, Versailles, France
2 shared publications - Alexander Chistov
St.Petersburg Department of Steklov Institute of Mathematics, St.Petersburg, Russia
1 shared publication - Alexander Chistov
Saint Petersburg Institute for Informatics and Automation of the Academy of Sciences of Russia, Saint Petersburg 199178
1 shared publication - Antoine Genitrini
PRiSM, CNRS UMR 8144, Université de Versailles Saint-Quentin-en-Yvelines, 45 av. des États-Unis, 78035 Versailles cedex, France
1 shared publication - Antoine Genitrini
Sorbonne Université CNRS LIP6 -UMR 7606
1 shared publication
Latest Publications
- 31 August 2011
- Published by Wiley in Random Structures & Algorithms
- Vol. 40 (3) , 317-349
The fraction of large random trees representing a given Boolean function in implicational logic
- 31 August 2011
- Published by Wiley in Random Structures & Algorithms
- Vol. 40 (3) , 317-349
The fraction of large random trees representing a given Boolean function in implicational logic
- 12 July 2010
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 56 (4) , 388-396
Tautologies over implication with negative literals
- 12 July 2010
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 56 (4) , 388-396
Tautologies over implication with negative literals
- 23 January 2010
- Published by Springer Nature in Algorithmica
- Vol. 59 (3) , 387-408
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
- 23 January 2010
- Published by Springer Nature in Algorithmica
- Vol. 59 (3) , 387-408
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
- 9 July 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (1) , 95-109
Fitting a Step Function to a Point Set
- 9 July 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (1) , 95-109
Fitting a Step Function to a Point Set
- Open Access
On the construction of a family of transversal subspaces over finite fields
Let k be a field. We are interested in the families of r-dimensional subspaces of kn with the following transversality property: any linear subspace of kn of dimension n-r is transversal to at least one element of the family. While it is known how to build such families in polynomial time over infinite fields k, no such technique is known for finite fields. However, transversal families in dimension n can be built when the field k is large enough with respect n. We improve here on how large k needs to be with respect to the considered dimension n.
Open AccessOn the construction of a family of transversal subspaces over finite fields
Let k be a field. We are interested in the families of r-dimensional subspaces of kn with the following transversality property: any linear subspace of kn of dimension n-r is transversal to at least one element of the family. While it is known how to build such families in polynomial time over infinite fields k, no such technique is known for finite fields. However, transversal families in dimension n can be built when the field k is large enough with respect n. We improve here on how large k needs to be with respect to the considered dimension n.
- 22 September 2007
- Published by Springer Nature in Algorithmica
- Vol. 49 (3) , 245-257
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
- 22 September 2007
- Published by Springer Nature in Algorithmica
- Vol. 49 (3) , 245-257
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
- 9 May 2003
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 3 (4) , 421-427
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
- 9 May 2003
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 3 (4) , 421-427
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces