2430 search results - page 47 / 486 » Computing Tutte Polynomials |
114
click to vote
ENDM
2010
15 years 2 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
106
click to vote
IPL
2000
15 years 2 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
133
click to vote
CAP
2010
14 years 9 months ago
2010
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
113
Voted
MOC
2000
15 years 2 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
120
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...