Hard satisfiable 3-SAT instances via autocorrelation

DOI10.3233/SAT190111zbMath1484.68145OpenAlexW2580735446MaRDI QIDQ5015598

Srinivasan Arunachalam, Ilias S. Kotsireas

Publication date: 9 December 2021

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

Full work available at URL: https://doi.org/10.3233/sat190111

zbMATH Keywords

autocorrelationSAT solverD-optimal matrices

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General lower bounds on maximal determinants of binary matrices
• SAT competition 2020
• Compression of periodic complementary sequences and applications
• D-optimal matrices via quadratic integer optimization
• New Results on D-Optimal Matrices
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Hard satisfiable 3-SAT instances via autocorrelation