8699 search results - page 297 / 1740 » Elements of the Theory of Computation |
198
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
182
click to vote
JDCTA
2010
15 years 1 months ago
2010
Performance indexes of the embedded real-time operating system are not isolated but interacting with each other. Two sets of elements aiming to describe the relationship between t...
167
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analyt...
177
click to vote
RELMICS
2001
Springer
15 years 11 months ago
2001
Springer
Groups are one of the most fundamental notions in mathematics. This paper provides a foundation of group theory in allegories. Almost all results in the paper can be applied to the...
164
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...