What makes an optimization problem hard?
Complexity
Kolmogorov Random Graphs and the Incompressibility Method
SIAM Journal on Computing
Information perspective of optimization
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |