2430 search results - page 46 / 486 » Computing Tutte Polynomials |
103
click to vote
IJAC
2006
15 years 2 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
108
click to vote
EJC
2000
15 years 2 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
101
click to vote
MICS
2007
15 years 1 months ago
2007
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
107
Voted
PDCAT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
137
click to vote
IJCAI
1993
15 years 3 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...