39 search results - page 2 / 8 » Polynomial Size Analysis of First-Order Functions |
ISAAC
2010
Springer
13 years 3 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
ASAP
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
SIAMSC
2008
13 years 5 months ago
2008
Abstract. We study high order numerical quadratures to one dimensional delta function integrals in this paper. This is motivated by the fact that traditional numerical quadratures ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...