692 search results - page 2 / 139 » Combinatorics of Partial Derivatives |
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
JCT
2010
13 years 8 months ago
2010
COMBINATORICS
1999
13 years 10 months ago
1999
Let Pn and Qn be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomia...
COMBINATORICS
2004
13 years 10 months ago
2004
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
BSL
2000
13 years 10 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...