2430 search results - page 280 / 486 » Computing Tutte Polynomials |
126
click to vote
JC
2008
15 years 3 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
97
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
149
click to vote
JSCIC
2008
15 years 3 months ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
142
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
106
Voted
JSC
2007
15 years 3 months ago
2007
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...