On the complexity of trial and error for constraint satisfaction problems

Gabor Ivanyos (1) , Raghav Kulkarni (2) , Youming Qiao (3) , Miklos Santha (4, 5, 6) , Aarthi Sundaram

1 Institute for Computer Science and Control [Budapest]
2 Chennai Mathematical Institute [Inde]
3 Institute for Theoretical Computer Science
4 CNRS - Centre National de la Recherche Scientifique
5 IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale
6 CQT - Centre for Quantum Technologies [Singapore]

Domaines: Complexité [cs.CC]

Gabor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram. On the complexity of trial and error for constraint satisfaction problems. Journal of Computer and System Sciences, 2018, 92, pp.48-64. ⟨10.1016/j.jcss.2017.07.005⟩. ⟨hal-02350754⟩