# Is the problem to construct a $\mathcal{O}\mbox{*}(1.4^n)$ (or better) time algorithm for subset sum still open?

Is the problem to construct a $$\mathcal{O}\mbox{*}(1.4^n)$$ (or better) time algorithm for subset sum still open? I wanted to check the problem before finishing a paper.

The most recent reference I found to this open problem is on next paper:

'SETH-Based Lower Bounds for Subset Sum and Bicriteria Path, Amir Abboud et al.' 2017 link

citing:

'Open problems around exact algorithms, Woeginger' 2008 link.

• It's probably still open. If not, you would probably find out about it in your literature search. – Yuval Filmus Sep 25 '18 at 5:29
• found another paper, from May/18 stating is still open, so I'll assume is open and move forward, thanks! – Jesus Salas Sep 25 '18 at 23:50
• People will cite your paper once published , "Yup, it is still open!". – John L. Sep 26 '18 at 19:43