Colloquium of the Faculty of Computer Science ' Some Adventures in Boolean Satisfiability and Its Logic Synthesis Applications '
On November 12 the Colloquium of the Faculty of Computer Science on 'Some Adventures in Boolean Satisfiability and Its Logic Synthesis Applications' will be held at HSE University.
Boolean satisfiability (SAT) is a fundamental NP-complete problem. Its general and simple formulation makes it an ideal problem to tackle.
Although SAT is intractable, many efficient solvers have been engineered and widely applied in industries.
This talk will introduce some of the key enabling techniques in SAT solving and showcase some applications in logic synthesis.
Start time: 16.40–18.00
Address: 11 Pokrovsky boulevard, room R401
Speaker: Jie-Hong Roland Jiang / National Taiwan University