1379 search results - page 52 / 276 » The Complexity of the Annihilating Polynomial |
69
Voted
DM
2007
15 years 15 days ago
2007
We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
99
Voted
CORR
1998
Springer
15 years 6 days ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
105
Voted
CASC
2010
Springer
14 years 11 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
STOC
2003
ACM
16 years 25 days ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
99
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...