19320 search results - page 90 / 3864 » On the complexity of computing determinants |
MOC
2000
14 years 9 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
112
click to vote
ECRTS
2003
IEEE
15 years 3 months ago
2003
IEEE
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
When performing hierarchical clustering, some metric must be used to determine the similarity between pairs of clusters. Traditional similarity metrics either can only deal with s...
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...