Colloquium Faculty of Computer Science: Jie-Hong Roland Jiang (National Taiwan University)

Colloquium Faculty of Computer Science: 
Jie-Hong Roland Jiang (National Taiwan University)
Some Adventures in Boolean Satisfiability and Its Logic Synthesis Applications

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.
 

November 12, 16.40–18.00
Pokrovsky boulevard, 11, room R401