Colloquium: Laurent Beaudou – "Of Points and Lines: Graphs, Metrics, and Betweenness"
Event ended
November 12, 16:40 – 18:00
Pokrovsky blvd 11, ауд. R205
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.
Date
February 18, 2020 18:10