1379 search results - page 98 / 276 » The Complexity of the Annihilating Polynomial |
205
click to vote
COMAD
2009
15 years 7 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
160
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
167
click to vote
TC
2008
15 years 6 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...