On the Complexity of Trial and Error for Constraint Satisfaction Problems

DOI10.1007/978-3-662-43948-7_55zbMath1382.68113OpenAlexW2952925137MaRDI QIDQ5167781

Raghav Kulkarni, Miklos Santha, Youming Qiao, Gábor Ivanyos, Aarthi Sundaram

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/130881

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Solving Linear Programming with Constraints Unknown ⋮ On the complexity of trial and error for constraint satisfaction problems

This page was built for publication: On the Complexity of Trial and Error for Constraint Satisfaction Problems