2430 search results - page 74 / 486 » Computing Tutte Polynomials |
140
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
152
click to vote
JSC
2010
15 years 4 months ago
2010
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
204
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
174
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
148
click to vote
PG
2007
IEEE
16 years 9 days ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...