Sciweavers

1383 search results - page 34 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
RTA
2010
Springer
15 years 1 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 10 months ago
On sign conditions over real multivariate polynomials
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
INFORMATICALT
2002
63views more  INFORMATICALT 2002»
14 years 9 months ago
Layered Polynomial Filter Structures
It is shown that nonlinear Volterra, polynomial autoregressive, and bilinear filters have the same layered implementation procedure. Using the layered structure, the order of nonli...
Kazys Kazlauskas, Jaunius Kazlauskas
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 4 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
ICASSP
2008
IEEE
15 years 4 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz