On the Complexity of Trial and Error for Constraint Satisfaction Problems

Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram. On the Complexity of Trial and Error for Constraint Satisfaction Problems. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Volume 8572 of Lecture Notes in Computer Science, pages 663-675, Springer, 2014. [doi]

Abstract

Abstract is missing.