SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

@inproceedings{Abboud2019SETHBasedLB,
  title={SETH-Based Lower Bounds for Subset Sum and Bicriteria Path},
  author={Amir Abboud and Karl Bringmann and Danny Hermelin and Dvir Shabtay},
  booktitle={SODA},
  year={2019}
}
Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

References

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

Losing Weight by Gaining Edges

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

On Problems as Hard as CNF-SAT

  • IEEE Conference on Computational Complexity
  • 2012
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Which problems have strongly exponential complexity?

  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

A duality between clause width and clause density for SAT

  • 21st Annual IEEE Conference on Computational Complexity (CCC'06)
  • 2006
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

On the Complexity of k-SAT

  • J. Comput. Syst. Sci.
  • 2001
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…