Sciweavers

1695 search results - page 118 / 339
» Linear, Polynomial or Exponential
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
On the time complexity of 2-tag systems and small universal Turing machines
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
Damien Woods, Turlough Neary
CEC
2005
IEEE
15 years 10 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
Power Series Composition and Change of Basis
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
Alin Bostan, Bruno Salvy, Éric Schost
FOCM
2008
77views more  FOCM 2008»
15 years 4 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
CAGD
2007
69views more  CAGD 2007»
15 years 4 months ago
On geometric interpolation of circle-like curves
In this paper, geometric interpolation of certain circle-like curves by parametric polynomial curves is studied. It is shown that such an interpolating curve of degree n achieves ...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Emil ...