484 search results - page 22 / 97 » Computing Hilbert Class Polynomials |
JAT
2010
13 years 6 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
WG
2007
Springer
14 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
CG
2000
Springer
13 years 7 months ago
2000
Springer
Chaotic attractors generated by the iteration of polynomial functions with cyclic symmetry have been the subject of recent study. A new formulation is investigated which generates ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...