Log In

Recent posts tagged learning

Consider the decision problem $2CNFSAT$ defined as follows: $\left\{ \phi \mid \phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause}\right\}$ ... polynomial time by reduction to directed graph reachability. solvable in constant time since any input instance is satisfiable. NP-hard but not NP-complete.
posted Jun 26, 2017 in Others Kuldeep Pal 2,200 views
To see more, click for the full list of questions or popular tags.