Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas-Reference-Cited by-同舟云学术

Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas

Published:2016-08-29 Issue:2 Volume:78 Page:561-586
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Doerr Benjamin,Neumann Frank,Sutton Andrew M.

Funder

Australian Research Council

Seventh Framework Programme

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-016-0190-3.pdf

Reference44 articles.

1. Achlioptas, D.: Random satisfiability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 245–270. IOS Press, Amsterdam, Netherlands (2009)

2. Achlioptas, D., Coja-Oghlan, A., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. Random Struct. Algorithms 38(3), 251–268 (2011)

3. Alekhnovich, M., Ben-Sasson, E.: Linear upper bounds for random walk on small density random 3-CNFs. SIAM J. Comput. 36(5), 1248–1263 (2007)

4. Altenberg, L.: Fitness distance correlation analysis: an instructive counterexample. In: Bäck, T. (eds.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 57–64. Morgan Kaufmann (1997)

5. Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co. Inc., Singapore (2011)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Choosing the right algorithm with hints from complexity theory;Information and Computation;2024-01

2. Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30

3. A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions;Algorithmica;2022-01-15

4. Frequency Fitness Assignment: Optimization without Bias for Good Solutions can be Efficient;IEEE Transactions on Evolutionary Computation;2022

5. A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization;ACM Transactions on Evolutionary Learning and Optimization;2021-12-31