On the complexity of trial and error for constraint satisfaction problems

@article{Ivanyos2018OnTC,
  title={On the complexity of trial and error for constraint satisfaction problems},
  author={G. Ivanyos and Raghav Kulkarni and Y. Qiao and M. Santha and Aarthi Sundaram},
  journal={J. Comput. Syst. Sci.},
  year={2018},
  volume={92},
  pages={48-64}
}
  • G. Ivanyos, Raghav Kulkarni, +2 authors Aarthi Sundaram
  • Published 2018
  • Computer Science
  • J. Comput. Syst. Sci.
  • 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… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES
    On the Complexity of Trial and Error for Constraint Satisfaction Problems
    5
    On the complexity of trial and error
    19
    The complexity of satisfiability problems
    1563
    First-Order Model Checking Problems Parameterized by the Model
    17
    Noncrossing Subgraphs in Topological Layouts
    45
    On Restricted Two-Factors
    41
    On the power of unique 2-prover 1-round games
    376
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    39840