484 search results - page 11 / 97 » Computing Hilbert Class Polynomials |
96
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
106
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
114
click to vote
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
106
click to vote
ARSCOM
2005
15 years 1 months ago
2005
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
113
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...