484 search results - page 25 / 97 » Computing Hilbert Class Polynomials |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
ADCM
2011
13 years 2 months ago
2011
Abstract: The Wendland radial basis functions [8, 9] are piecewise polynomial compactly supported reproducing kernels in Hilbert spaces which are norm–equivalent to Sobolev space...
DAM
2002
13 years 7 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...