Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

@article{Jonsson2014RelatingTT,
  title={Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis},
  author={Peter Jonsson and Victor Lagerkvist and Johannes Schmidt and Hannes Uppman},
  journal={ArXiv},
  year={2014},
  volume={abs/1406.3247}
}
  • Peter Jonsson, Victor Lagerkvist, +1 author Hannes Uppman
  • Published 2014
  • Computer Science, Mathematics
  • ArXiv
  • Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-hard SAT(·) problem. In this paper we extend this method and show that such languages also exist for the… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

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

    The weak base method for constraint satisfaction

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    The complexity of soft constraint satisfaction

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    The Approximability of Constraint Satisfaction Problems

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    On Generating All Solutions of Generalized Satisfiability Problems

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Relating the time complexity of optimization problems in light of the exponential-time hypothesis

    • P. Jonsson, V. Lagerkvist, J. Schmidt, H. Uppman
    • CoRR, abs/1406.3247,
    • 2014
    VIEW 2 EXCERPTS

    Relating the time complexity of optimization problems in light of the exponential-time hypothesis. CoRR, abs/1406

    • P Jonsson, V Lagerkvist, J Schmidt, H Uppman
    • Relating the time complexity of optimization problems in light of the exponential-time hypothesis. CoRR, abs/1406
    • 2014

    Weak bases of Boolean co-clones

    VIEW 1 EXCERPT