# 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} }

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

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

## On the Strength of Uniqueness Quantification in Primitive Positive Formulas

VIEW 1 EXCERPT

CITES BACKGROUND

## The power of primitive positive definitions with polynomially many variables

VIEW 1 EXCERPT

CITES BACKGROUND

## Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem

VIEW 1 EXCERPT

CITES RESULTS

#### 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

VIEW 2 EXCERPTS

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

## Weak bases of Boolean co-clones

VIEW 1 EXCERPT

## Explorer On the Limits of Sparsification

VIEW 2 EXCERPTS