On the Complexity of Trial and Error for Constraint Satisfaction Problems

  • Gábor Ivanyos
  • Raghav Kulkarni
  • Youming Qiao
  • Miklos Santha
  • Aarthi Sundaram
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8572)

Abstract

In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle which, for a candidate assignment, reveals some information about a violated constraint if the assignment is not satisfying. In this paper we initiate a systematic study of constraint satisfaction problems in the trial and error model. To achieve this, we first adopt a formal framework for CSPs, and based on this framework we define several types of revealing oracles. Our main contribution is to develop a transfer theorem for each type of the revealing oracle, under a broad class of parameters. To any hidden CSP with a specific type of revealing oracle, the transfer theorem associates another, potentially harder CSP in the normal setting, such that their complexities are polynomial time equivalent. This in principle transfers the study of a large class of hidden CSPs, possibly with a promise on the instances, to the study of CSPs in the normal setting. We then apply the transfer theorems to get polynomial-time algorithms or hardness results for hidden CSPs, including satisfaction problems, monotone graph properties, isomorphism problems, and the exact version of the Unique Games problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bei, X., Chen, N., Dou, L., Huang, X., Qiang, R.: Trial and error in influential social networks. In: KDD, pp. 1016–1024 (2013)Google Scholar
  2. 2.
    Bei, X., Chen, N., Zhang, S.: On the complexity of trial and error. In: STOC, pp. 31–40 (2013)Google Scholar
  3. 3.
    Bei, X., Chen, N., Zhang, S.: Solving linear programming with constraints unknown. CoRR, abs/1304.1247 (2013)Google Scholar
  4. 4.
    Feder, T., Vardi, M.Y.: The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28(1), 57–104 (1999)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Martin, B.: First-order model checking problems parameterized by the model. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 417–427. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Schaefer, T.J.: The complexity of satisfiability problems. In: STOC, pp. 216–226 (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Gábor Ivanyos
    • 1
  • Raghav Kulkarni
    • 2
  • Youming Qiao
    • 2
    • 4
  • Miklos Santha
    • 2
    • 3
  • Aarthi Sundaram
    • 2
  1. 1.Institute for Computer Science and ControlHungarian Academy of SciencesBudapestHungary
  2. 2.Centre for Quantum TechnologiesNational University of SingaporeSingapore
  3. 3.LIAFAUniv. Paris 7, CNRSParisFrance
  4. 4.Centre for Quantum Computation and Intelligent SystemsUniversity of TechnologySydneyAustralia

Personalised recommendations