Can you solve closest string faster than exhaustive search?

DOI10.4230/LIPICS.ESA.2023.3MaRDI QIDQ6656939

C. S. Karthik, Ron Safier, Elazar Goldenberg, Nick Fischer, Amir Abboud

Publication date: 6 January 2025

zbMATH Keywords

inclusion-exclusionSETHclosest stringfine-grained complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Can you solve closest string faster than exhaustive search?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656939)