Unique-SAT

E1115574 UNEXPLORED

Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.

Try in SPARQL Jump to: Referenced by

Referenced by (1)

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

Valiant–Vazirani theorem → showsHardnessOf → Unique-SAT ⓘ