Sciweavers

425 search results - page 12 / 85
» Polynomial Factorization 1987-1991
Sort
View
ISCAS
2002
IEEE
85views Hardware» more  ISCAS 2002»
14 years 9 days ago
The Cauchy-Floquet factorization by successive Riccati transformations
Scalar linear time-varying systems are addressed. In particular, a new factorization method for the associated scalar polynomial system differential operator is presented. It diff...
P. van der Kloet, F. L. Neerhoff
ICALP
2009
Springer
14 years 7 months ago
Factoring Groups Efficiently
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
Neeraj Kayal, Timur Nezhmetdinov
JCT
2000
81views more  JCT 2000»
13 years 7 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
13 years 11 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
TIT
2010
98views Education» more  TIT 2010»
13 years 2 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei