Skip to content

Author

F. Stephan

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Solving Restricted Versions of #SAT Faster than $2^m$: Algorithms and Lower Bounds

Under the Strong Exponential Time Hypothesis (SETH), for any constant $\varepsilon>0$, the #SAT problem (counting the number of satisfying assignments of a CNF formula) cannot be solved in $\mathcal{O}^*((2-\varepsilon)^n)$ or $\mathcal{O}^*((2-\varepsilon)^m)$ time, where $n$ is the number of variables and $m$ is the...

Sanjay Jain, Jun-Qiang Peng, F. Stephan et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.