Sciweavers

664 search results - page 10 / 133
» Some results for a class of generalized polynomials
Sort
View
LICS
2010
IEEE
13 years 5 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
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...
Martin Grohe
SIAMCO
2008
96views more  SIAMCO 2008»
13 years 7 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
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...
JCT
2006
81views more  JCT 2006»
13 years 7 months ago
New identities involving Bernoulli and Euler polynomials
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...
Hao Pan, Zhi-Wei Sun
EJC
2006
13 years 7 months ago
Product representations of polynomials
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...
Jacques Verstraëte
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
13 years 11 months ago
Structural Properties and Tractability Results for Linear Synteny
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...
David Liben-Nowell, Jon M. Kleinberg