793 search results - page 15 / 159 » Efficient computation of the characteristic polynomial |
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
CIC
2004
13 years 9 months ago
2004
Overlay topologies are now popular with many emerging peer-to-peer (P2P) systems, to efficiently locate and retrieve information. In contrast, the focus of this work is to use ove...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
ECCC
1998
13 years 7 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
COMBINATORICS
2004
13 years 7 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...