1. Light up is NP-complete - mountain vista soft;McPhail,2005
2. Computational complexity of games and puzzles;Costa,2018
3. A nested two-steps evolutionary algorithm for the light-up puzzle;Salcedo-Sanz;ICGA J.,2009
4. B.N. Oreshkin, D. Carpov, N. Chapados, Y. Bengio, N-BEATS: Neural basis expansion analysis for interpretable time series forecasting, in: 8th Int. Conf. on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, 2020, http://dx.doi.org/10.48550/arxiv.1905.10437.
5. The fewest clues problem;Demaine;Theoret. Comput. Sci.,2018