Circuit Security and SAT solving

[ with UC Davis, George Manson University ]

Boolean Satisfiability (SAT) problem is a fundamental problem in computer science and the core of many real-world applications such as hardware and software design. However, its solving or estimating hardness of SAT is NP-hard. We are seeking for a series of a methodology by deep learning to significantly accelerate its solving and estimation.

Avatar
Zhiqian Chen
Assistant Professor

Zhiqian Chen is an Assistant Professor at Department of Computer Science and Engineering at Mississippi State University, focusing on graph machine learning.

Related