Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas.
Benjamin DoerrFrank NeumannAndrew M. SuttonPublished in: Algorithmica (2017)
Keyphrases
- complexity analysis
- cnf formula
- evolutionary algorithm
- np complete
- max sat
- truth assignment
- lower bound
- initial population
- sat problem
- multi objective
- evolutionary search
- optimization problems
- computational complexity
- theoretical analysis
- differential evolution
- fitness function
- differential evolution algorithm
- randomly generated
- randomly chosen
- conjunctive normal form
- propositional formulas
- knowledge compilation
- davis putnam
- genetic algorithm
- first order logic
- evolutionary process
- random instances
- branch and bound
- satisfiability problem
- search strategies
- simulated annealing
- upper bound
- information retrieval
- phase transition
- neural network
- constraint satisfaction problems
- dynamic programming
- tabu search
- objective function
- database systems