The Easiest Hard Problem: Now Even Easier
(2024)
Presentation / Conference Contribution
Horn, R., Thomson, S. L., van den Berg, D., & Adriaans, P. (2024, July). The Easiest Hard Problem: Now Even Easier. Presented at ACM Genetic and Evolutionary Computation Conference (GECCO) 2024, Melbourne, Australia
We present an exponential decay function that characterizes the number of solutions to instances of the Number Partitioning Problem (NPP) with uniform distribution of bits across the integers. This function is fitted on the number of optimal solution... Read More about The Easiest Hard Problem: Now Even Easier.