We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich...
For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...