467 search results - page 18 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
104
click to vote
MFCS
2010
Springer
14 years 9 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
101
click to vote
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
FFA
2008
14 years 11 months ago
2008
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
120
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
112
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...