The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
From MaRDI portal
Publication:5868883
DOI10.1145/3492336zbMath1495.68158OpenAlexW4200344539WikidataQ130949699 ScholiaQ130949699MaRDI QIDQ5868883
Victor Lagerkvist, Magnus Wahlström
Publication date: 24 September 2022
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3492336
Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07)
This page was built for publication: The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems