\begin{thebibliography}{CFKL15}
\bibitem[AFLS01]{AFLS01} K. Allemand, K. Fukuda, T. M. Liebling and E. Steiner, \emph{A polynomial case of unconstrained zero-one quadratic optimization}, Math. Program. \textbf{91} (2001), 49--52. \href{https://doi.org/10.1007/s101070100233}{doi:10.1007/s101070100233}
\bibitem[Bar82]{Barahona82} F. Barahona, \emph{On the computational complexity of Ising spin glass models}, J. Phys. A \textbf{15} (1982), no. 10, 3241--3253. \href{https://doi.org/10.1088/0305-4470/15/10/028}{doi:10.1088/0305-4470/15/10/028}
\bibitem[BG05]{BG05} A. Bulatov and M. Grohe, \emph{The complexity of partition functions}, Theoret. Comput. Sci. \textbf{348} (2005), no. 2--3, 148--186. \href{https://doi.org/10.1016/j.tcs.2005.09.011}{doi:10.1016/j.tcs.2005.09.011}
\bibitem[Bha26a]{Bha26a} S. Singha Roy, D. Bhattacharjee, S. Samal, S. Nandi, N. Thakur, S. Sadhu, U. Bhattacharya, S. Dey, L. Frederick, S. Ghora and K. Patra, \emph{Quantum algorithms on symplectic state manifolds}, SSRN preprint (2026). \href{https://doi.org/10.2139/ssrn.6114107}{doi:10.2139/ssrn.6114107}
\bibitem[Bha26b]{Bha26b} D. Bhattacharjee and U. Bhattacharya, \emph{Iterated nerve complexes for $k$-fold sensor coverage}, Preprints.org (2026). \href{https://doi.org/10.20944/preprints202606.1351.v2}{doi:10.20944/preprints202606.1351.v2}
\bibitem[Bha26c]{Bha26c} D. Bhattacharjee, \emph{Neuromorphic Grothendieck topoi for grid-embedded circuit architectures}, SSRN preprint (2026). \href{https://doi.org/10.2139/ssrn.6194939}{doi:10.2139/ssrn.6194939}
\bibitem[Bha26d]{Bha26arch} D. Bhattacharjee, \emph{Source and verification code for the paper Subexponential Weighted Counting and Exact Optimisation}, GitHub repository \url{https://github.com/creelie/eCon}\archiveline.
\bibitem[BMT78]{BMT78} E. R. Berlekamp, R. J. McEliece and H. C. A. van Tilborg, \emph{On the inherent intractability of certain coding problems}, IEEE Trans. Inform. Theory \textbf{24} (1978), no. 3, 384--386. \href{https://doi.org/10.1109/TIT.1978.1055873}{doi:10.1109/TIT.1978.1055873}
\bibitem[CFKL15]{CFKLMPPS15} M. Cygan, F. V. Fomin, {\L}. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk and S. Saurabh, \emph{Parameterized Algorithms}, Springer, Cham, 2015. \href{https://doi.org/10.1007/978-3-319-21275-3}{doi:10.1007/978-3-319-21275-3}
\bibitem[CIP06]{CIP06} C. Calabro, R. Impagliazzo and R. Paturi, \emph{A duality between clause width and clause density for SAT}, in: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), IEEE, 2006, pp. 252--260. \href{https://doi.org/10.1109/CCC.2006.6}{doi:10.1109/CCC.2006.6}
\bibitem[CKJ01]{CKJ01} J. Chen, I. A. Kanj and W. Jia, \emph{Vertex cover: further observations and further improvements}, J. Algorithms \textbf{41} (2001), no. 2, 280--301. \href{https://doi.org/10.1006/jagm.2001.1186}{doi:10.1006/jagm.2001.1186}
\bibitem[CP15]{CP15} M. Cygan and M. Pilipczuk, \emph{Faster exponential-time algorithms in graphs of bounded average degree}, Inform. and Comput. \textbf{243} (2015), 75--85. \href{https://doi.org/10.1016/j.ic.2014.12.007}{doi:10.1016/j.ic.2014.12.007}
\bibitem[DG00]{DG00} M. Dyer and C. Greenhill, \emph{The complexity of counting graph homomorphisms}, Random Structures Algorithms \textbf{17} (2000), no. 3--4, 260--289. \href{https://doi.org/10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W}{doi:10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W}
\bibitem[DHMTW14]{DHMTW14} H. Dell, T. Husfeldt, D. Marx, N. Taslaman and M. Wahl\'en, \emph{Exponential time complexity of the permanent and the Tutte polynomial}, ACM Trans. Algorithms \textbf{10} (2014), no. 4, Art. 21, 1--32. \href{https://doi.org/10.1145/2635812}{doi:10.1145/2635812}
\bibitem[FK72]{FK72} C. M. Fortuin and P. W. Kasteleyn, \emph{On the random-cluster model. I. Introduction and relation to other models}, Physica \textbf{57} (1972), no. 4, 536--564. \href{https://doi.org/10.1016/0031-8914(72)90045-6}{doi:10.1016/0031-8914(72)90045-6}
\bibitem[Gal62]{Gal62} R. G. Gallager, \emph{Low-density parity-check codes}, IRE Trans. Inform. Theory \textbf{8} (1962), no. 1, 21--28. \href{https://doi.org/10.1109/TIT.1962.1057683}{doi:10.1109/TIT.1962.1057683}
\bibitem[Gon85]{Gon85} T. F. Gonzalez, \emph{Clustering to minimize the maximum intercluster distance}, Theoret. Comput. Sci. \textbf{38} (1985), 293--306. \href{https://doi.org/10.1016/0304-3975(85)90224-5}{doi:10.1016/0304-3975(85)90224-5}
\bibitem[Hoe63]{Hoe63} W. Hoeffding, \emph{Probability inequalities for sums of bounded random variables}, J. Amer. Statist. Assoc. \textbf{58} (1963), no. 301, 13--30. \href{https://doi.org/10.1080/01621459.1963.10500830}{doi:10.1080/01621459.1963.10500830}
\bibitem[Hol81]{Hol81} I. Holyer, \emph{The NP-completeness of edge-coloring}, SIAM J. Comput. \textbf{10} (1981), no. 4, 718--720. \href{https://doi.org/10.1137/0210055}{doi:10.1137/0210055}
\bibitem[IP01]{IP01} R. Impagliazzo and R. Paturi, \emph{On the complexity of $k$-SAT}, J. Comput. System Sci. \textbf{62} (2001), no. 2, 367--375. \href{https://doi.org/10.1006/jcss.2000.1727}{doi:10.1006/jcss.2000.1727}
\bibitem[IPZ01]{IPZ01} R. Impagliazzo, R. Paturi and F. Zane, \emph{Which problems have strongly exponential complexity?}, J. Comput. System Sci. \textbf{63} (2001), no. 4, 512--530. \href{https://doi.org/10.1006/jcss.2001.1774}{doi:10.1006/jcss.2001.1774}
\bibitem[JN83]{JN83} D. S. Johnson and K. A. Niemi, \emph{On knapsacks, partitions, and a new dynamic programming technique for trees}, Math. Oper. Res. \textbf{8} (1983), no. 1, 1--14. \href{https://doi.org/10.1287/moor.8.1.1}{doi:10.1287/moor.8.1.1}
\bibitem[JS93]{JS93} M. Jerrum and A. Sinclair, \emph{Polynomial-time approximation algorithms for the Ising model}, SIAM J. Comput. \textbf{22} (1993), no. 5, 1087--1116. \href{https://doi.org/10.1137/0222066}{doi:10.1137/0222066}
\bibitem[JVW90]{JVW90} F.~Jaeger, D.~L.~Vertigan and D.~J.~A.~Welsh, \emph{On the computational complexity of the Jones and Tutte polynomials}, Math. Proc. Cambridge Philos. Soc. \textbf{108} (1990), 35--53. \href{https://doi.org/10.1017/S0305004100068936}{doi:10.1017/S0305004100068936}
\bibitem[MW96]{MW96} M. Mihail and P. Winkler, \emph{On the number of Eulerian orientations of a graph}, Algorithmica \textbf{16} (1996), no. 4--5, 402--414. \href{https://doi.org/10.1007/BF01940872}{doi:10.1007/BF01940872}
\bibitem[NT75]{NT75} G. L. Nemhauser and L. E. Trotter, Jr., \emph{Vertex packings: structural properties and algorithms}, Math. Programming \textbf{8} (1975), 232--248. \href{https://doi.org/10.1007/BF01580444}{doi:10.1007/BF01580444}
\bibitem[OAI26]{OAI26} OpenAI, \emph{The exponential time hypothesis is false}, preprint, 25 October 2026, \url{https://github.com/openai/math/blob/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf}.
\bibitem[PS09]{PS09} U. Pferschy and J. Schauer, \emph{The knapsack problem with conflict graphs}, J. Graph Algorithms Appl. \textbf{13} (2009), no. 2, 233--249. \href{https://doi.org/10.7155/jgaa.00186}{doi:10.7155/jgaa.00186}
\bibitem[PY91]{PY91} C. H. Papadimitriou and M. Yannakakis, \emph{Optimization, approximation, and complexity classes}, J. Comput. System Sci. \textbf{43} (1991), no. 3, 425--440. \href{https://doi.org/10.1016/0022-0000(91)90023-X}{doi:10.1016/0022-0000(91)90023-X}
\bibitem[Sok05]{Sok05} A. D. Sokal, \emph{The multivariate Tutte polynomial (alias Potts model) for graphs and matroids}, in: Surveys in Combinatorics 2005, London Math. Soc. Lecture Note Ser. \textbf{327}, Cambridge Univ. Press, 2005, pp. 173--226. \href{https://doi.org/10.1017/CBO9780511734885.009}{doi:10.1017/CBO9780511734885.009}
\bibitem[SS09]{SS09} A. D. Scott and G. B. Sorkin, \emph{Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function}, ACM Trans. Algorithms \textbf{5} (2009), no. 4, Art. 45. \href{https://doi.org/10.1145/1597036.1597049}{doi:10.1145/1597036.1597049}
\bibitem[Tut54]{Tut54} W. T. Tutte, \emph{A contribution to the theory of chromatic polynomials}, Canad. J. Math. \textbf{6} (1954), 80--91. \href{https://doi.org/10.4153/CJM-1954-010-9}{doi:10.4153/CJM-1954-010-9}
\bibitem[Val79]{Val79} L. G. Valiant, \emph{The complexity of enumeration and reliability problems}, SIAM J. Comput. \textbf{8} (1979), no. 3, 410--421. \href{https://doi.org/10.1137/0208032}{doi:10.1137/0208032}
\bibitem[Var97]{Var97} A. Vardy, \emph{The intractability of computing the minimum distance of a code}, IEEE Trans. Inform. Theory \textbf{43} (1997), no. 6, 1757--1766. \href{https://doi.org/10.1109/18.641542}{doi:10.1109/18.641542}
\bibitem[Wil05]{Wil05} R. Williams, \emph{A new algorithm for optimal 2-constraint satisfaction and its implications}, Theoret. Comput. Sci. \textbf{348} (2005), no. 2--3, 357--365. \href{https://doi.org/10.1016/j.tcs.2005.09.023}{doi:10.1016/j.tcs.2005.09.023}
\bibitem[XN17]{XN17} M. Xiao and H. Nagamochi, \emph{Exact algorithms for maximum independent set}, Inform. and Comput. \textbf{255} (2017), 126--146. \href{https://doi.org/10.1016/j.ic.2017.06.001}{doi:10.1016/j.ic.2017.06.001}
\end{thebibliography}