Results 1 
2 of
2
PRIMES is in P
 Ann. of Math
, 2002
"... We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1 ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
(Show Context)
We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1
GAHardness Revisited
 Genetic and Evolutionary Computation  GECCO 2003, Genetic and Evolutionary Computation Conference
, 2003
"... Informally GAhardness asks what makes a problem hard or easy for Genetic Algorithms (GAs) to optimize. Characterizing GAhardness has received significant attention since the invention of GAs, yet it remains quite open. In this paper, we first present an abstract, general framework of problem (insta ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Informally GAhardness asks what makes a problem hard or easy for Genetic Algorithms (GAs) to optimize. Characterizing GAhardness has received significant attention since the invention of GAs, yet it remains quite open. In this paper, we first present an abstract, general framework of problem (instance) hardness and algorithm performance for search based on Kolmogorov complexity. We also show, by Rice's theorem, the nonexistence of a predictive GAhardness measure based only on the description of the problem instance and the configurations of the GA. We then examine several major misconceptions in previous GAhardness research in the context of this theory. Finally, we propose some promising directions for future research.