2430 search results - page 205 / 486 » Computing Tutte Polynomials |
146
click to vote
APPML
2005
15 years 4 months ago
2005
We consider a fourth-order eigenvalue problem on a semi-infinite strip which arises in the study of viscoelastic shear flow. The eigenvalues and eigenfunctions are computed by a s...
106
click to vote
DCG
2002
15 years 4 months ago
2002
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...
136
click to vote
TCS
2002
15 years 4 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
129
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
138
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...