doi:j.ipl

Source URL: www.cc.ntut.edu.tw

• Automated theorem proving
• NP-complete problems
• Unit propagation
• 2-satisfiability
• Time complexity
• Variable
• MAX-3SAT
• (SAT
• ε-UNSAT)
• Theoretical computer science
• Mathematics
• Computational complexity theory