2430 search results - page 143 / 486 » Computing Tutte Polynomials |
111
click to vote
JSC
2008
15 years 4 months ago
2008
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
149
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
194
click to vote
DISOPT
2011
14 years 8 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
645
click to vote
Lecture Notes
"These notes were originally prepared during Fall quarter 2003 for UCSD Math 174, Numerical Methods."