230 search results - page 11 / 46 » Faster algorithms for the characteristic polynomial |
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
JSC
2006
14 years 9 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
ISAAC
1993
Springer
15 years 1 months ago
1993
Springer
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
MOC
1998
14 years 9 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...