Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time

Rocco A. Servedio, Li-Yang Tan. Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 813-823, IEEE Computer Society, 2017. [doi]

Abstract

Abstract is missing.