Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini. Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1264-1277, SIAM, 2013. [doi]
No references recorded for this publication.
No citations of this publication recorded.