484 search results - page 8 / 97 » Computing Hilbert Class Polynomials |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
COMPUTING
2007
13 years 7 months ago
2007
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...