2430 search results - page 12 / 486 » Computing Tutte Polynomials |
SIAMNUM
2010
13 years 2 months ago
2010
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
TCS
2008
13 years 7 months ago
2008
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
JSC
2006
13 years 7 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...