-
A framework for Symbolic and Numeric Computations
The need to combine symbolic and numeric computations is ubiquitous is many problems such as the forward and inverse kinematics of robots, motion planning, the... -
A Primitive Recursive Algorithm for the General Petri Net Reachability Problem
The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive. -
Algebraic polynomials and moments of stochastic integrals
International audience -
On the typical rank of real binary forms
International audience -
Higher Order Active Contours
We introduce a new class of active contour models that hold great promise for region and shape modelling, and we apply a special case of these models to the extraction... -
Improved bounds for the CF algorithm
International audience -
Unconstraint global polynomial optimization via Gradient Ideal
In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function,... -
On the Boolean complexity of real root refinement
International audience -
Polynomials and coefficients
Valiant defines algebraic analogues of the classes P and NP. We characterize the classes VP and VQP, yielding a simplified proof of VNP = VNPe and of the... -
Compact relaxations for polynomial programming problems
Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer)... -
Reduced RLT constraints for polynomial programming
International audience -
Une comparaison entre deux méthodes de recherche locale pour la reconstructio...
International audience -
Factorization in Z[x]: the searching phase
Colloque avec actes et comité de lecture. internationale.
