10271 search results - page 429 / 2055 » Computer Science |
197
click to vote
FOCS
1992
IEEE
15 years 9 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 ...
158
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
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...
131
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
139
Voted
TCS
2008
15 years 4 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
111
click to vote
GI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract: Sowohl im praktischen Diskurs von Bürgerrechtsvertretern und Datenschützern wie auch in theoretisch ausgerichteten Debatten werden Ausdrücke wie Ubiquitous Computing, ...