2-SAT

E1750895 UNEXPLORED

2-SAT is a special case of the Boolean satisfiability problem where each clause has at most two literals and which can be solved efficiently in polynomial time using graph-based algorithms.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
2-SAT canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

SAT → hasImportantVariant → 2-SAT ⓘ