6274 search results - page 292 / 1255 » From query complexity to computational complexity |
172
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
141
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
As computing systems grow in complexity, the cluster and grid communities require more sophisticated tools to diagnose, debug and analyze such systems. We have developed a toolkit...
156
Voted
GLOBAL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Global computing applications co-ordinate distributed computations across widely-dispersed hosts. Such systems present formidable design and implementation challenges to ...
155
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
188
Voted
DSVIS
2006
Springer
15 years 9 months ago
2006
Springer
The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written a...