The following pages link to Hervé Fournier (Q547280):
Displaying 34 items.
- (Q197765) (redirect page) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns (Q633835) (← links)
- On the construction of a family of transversal subspaces over finite fields (Q929484) (← links)
- Universal relations and {\#}P-completeness (Q954984) (← links)
- On the shape of decomposable trees (Q1043555) (← links)
- Quantifier rank for parity of embedded finite models. (Q1401237) (← links)
- Vandermonde matrices, NP-completeness and transversal subspaces (Q1430506) (← links)
- A deterministic algorithm for fitting a step function to a weighted point-set (Q1943605) (← links)
- Computing the Gromov hyperbolicity of a discrete metric space (Q2345853) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- A degree bound on decomposable trees (Q2368920) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- (Q2754200) (← links)
- On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant (Q2849931) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- (Q2904776) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- Universal Relations and #P-Completeness (Q3434571) (← links)
- Lower Bounds for Geometric Diameter Problems (Q3525782) (← links)
- Fitting a Step Function to a Point Set (Q3541106) (← links)
- Tautologies over implication with negative literals (Q3583801) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- Classical and Intuitionistic Logic Are Asymptotically Identical (Q3608412) (← links)
- (Q4542570) (← links)
- (Q4779159) (← links)
- Balanced And/Or trees and linear threshold functions (Q5194664) (← links)
- Lower bounds for depth 4 formulas computing iterated matrix multiplication (Q5259546) (← links)
- (Q5368898) (← links)
- (Q5875648) (← links)
- Sparse NP-complete problems over the reals with addition (Q5941089) (← links)
- Towards optimal depth-reductions for algebraic formulas (Q6640365) (← links)
