13306 search results - page 353 / 2662 » Theoretical Computer Science |
242
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
215
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
170
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
201
click to vote
ITICSE
1996
ACM
15 years 11 months ago
1996
ACM
The operation of a computer can be conceptualised as a large, discrete and constantly changing set of state information. However even for the simplest uni-processor the data set o...
156
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...