2430 search results - page 188 / 486 » Computing Tutte Polynomials |
182
click to vote
AAECC
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
164
click to vote
IJHPCA
2006
15 years 7 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
163
click to vote
DCC
2002
IEEE
15 years 6 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
169
click to vote
TCS
2011
15 years 1 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
421
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...