Hard satisfiable 3-SAT instances via autocorrelation

DOI10.3233/SAT190111zbMath1484.68145MaRDI QIDQ5015598

Ilias S. Kotsireas, Srinivasan Arunachalam

Publication date: 9 December 2021

Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

zbMATH Keywords

autocorrelation; SAT solver; D-optimal matrices

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68R07: Computational aspects of satisfiability