Algorithms for general SAT
- Speaker
- Jian Ma
- Affiliation
- University of Electronic and Science Technology of China
- Date
- Time
- – Asia/Shanghai
- Venue
- Qingshuihe Campus
Abstract
The CNF satisfiability problem is defined as follows: given a CNF formula $F$, decide if there exists truth-value assignment to variables such that the formula evaluates to true. In this talk, I will introduce an algorithm for both general SAT and general k-SAT, which behaves well in competiton-level experiments and is potential to be a nice theoretical algorithm.
Schedule
- 10:00-12:00 (Time in Beijing)
- 15:00-17:00 (Time in Auckland)
- November 5, 2021 (Friday)