How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?

Jean-François Culus, Sophie Toulouse. How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?. In Costas S. Iliopoulos, Hon Wai Leong, Wing-Kin Sung, editors, Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings. Volume 10979 of Lecture Notes in Computer Science, pages 374-386, Springer, 2018. [doi]

Abstract

Abstract is missing.