484 search results - page 7 / 97 » Computing Hilbert Class Polynomials |
IANDC
2006
13 years 7 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
WCE
2007
13 years 8 months ago
2007
— A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises...
CAGD
2002
13 years 7 months ago
2002
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
GC
2008
Springer
13 years 7 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
WG
2005
Springer
14 years 28 days ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...