10392 search results - page 435 / 2079 » Introduction to Computer Science |
262
Voted
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 ...
226
click to vote
RTA
2010
Springer
15 years 11 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...
205
Voted
ESCIENCE
2006
IEEE
15 years 11 months ago
2006
IEEE
Instruments and sensors are the primary sources of data driving science and the development and refinement of theory. A critical component of eresearch yet to be clarified is the ...
185
Voted
CSR
2008
Springer
15 years 9 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...
194
click to vote
TCS
2008
15 years 7 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...