2430 search results - page 65 / 486 » Computing Tutte Polynomials |
JCT
2006
15 years 2 months ago
2006
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
94
Voted
ACIVS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. To construct a very smooth nonseparable multiscaling function, we impose polynomial approximation order 2 and add new conditions on the polyphase highpass filters. We wo...
100
click to vote
CA
1996
IEEE
15 years 6 months ago
1996
IEEE
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
116
click to vote
RTA
2010
Springer
15 years 6 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...