2430 search results - page 43 / 486 » Computing Tutte Polynomials |
CSR
2008
Springer
13 years 12 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
HPCS
2009
IEEE
14 years 1 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
ICLP
2009
Springer
14 years 10 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
CC
2005
Springer
13 years 10 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...