Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas |
scientific article |
Statements
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (English)
0 references
7 July 2017
0 references
runtime analysis
0 references
satisfiability
0 references
fitness-distance correlation
0 references
0 references
0 references