Its is known that 3SAT (all clauses have size 3) is NP-complete. But how about 1SAT (all clauses have size 1), is it also NP-complete? I tried searching for it a lot, but couldnt find any proofs or explanations for the same.Like 3SAT has 3 clauses, what if I consider just one clause?Thanks for the help in advance.
3SAT is NP-complete, however is 1SAT NP-complete?
algorithms;3 sat