2430 search results - page 52 / 486 » Computing Tutte Polynomials |
DCC
2004
IEEE
14 years 9 months ago
2004
IEEE
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
ISSAC
1995
Springer
14 years 1 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
UC
2005
Springer
14 years 3 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer