Date: 2008-03-02 23:12:13

Automated theorem proving

NP-complete problems

Unit propagation

2-satisfiability

Time complexity

Variable

MAX-3SAT

(SAT

ε-UNSAT)

Theoretical computer science

Mathematics

Computational complexity theory

doi:j.ipl

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

File Size: 126,13 KB