484 search results - page 59 / 97 » Computing Hilbert Class Polynomials |
148
click to vote
LATIN
2010
Springer
16 years 23 days ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
140
click to vote
CEC
2007
IEEE
16 years 9 days ago
2007
IEEE
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
162
click to vote
ICALP
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
171
click to vote
RTA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
145
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...