An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities

Maxim Buzdalov. An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities. In Tobias Friedrich, Frank Neumann, Andrew M. Sutton, editors, Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings. pages 147-148, ACM, 2016. [doi]

Abstract

Abstract is missing.