Welcome to the Boolean Satisfiability Research Group at Princeton University
Boolean Satisfiability Problem is a well known NP-Complete problem. It's theoretical importance is well documented in various computational theory textbooks. It also plays a very important role in real world applications such as:
At Princeton University, we are doing some very exciting research in SAT related areas. Our focus is mainly on EDA applications using SAT method. However, the results are also applicable to other fields.
The SAT Research Group is led by Professor Sharad Malik in Electrical Engineering Department.
Contact the Webmaster for comments and suggestions.
Home | People | Publications | Software | Links | SAT Paper Library
© Copyright: 2001-2004 SAT Research Group, Princeton University