2430 search results - page 84 / 486 » Computing Tutte Polynomials |
106
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
121
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
118
Voted
COMGEO
2004
ACM
15 years 2 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
122
Voted
TCS
2008
15 years 2 months ago
2008
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
98
Voted
COMBINATORICS
2000
15 years 2 months ago
2000
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...