Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction

@inproceedings{Jonsson2013BlowingHI,
  title={Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction},
  author={Peter Jonsson and Victor Lagerkvist and Gustav Nordh},
  booktitle={CP},
  year={2013}
}
We consider methods for constructing NP-intermediate problems under the assumption that P 6= NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

What makes propositional abduction tractable

  • Artif. Intell.
  • 2008
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of homomorphism and constraint satisfaction problems seen from the other side

  • 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

and D

H. Del
  • van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proc. 42nd ACM Symposium on Theory of Computing (STOC-2010), pages 251–260,
  • 2010
VIEW 1 EXCERPT