2-satisfiability

Summary

2-satisfiability is a computational problem^[1]. 2-satisfiability draws 83 Wikipedia views per month (computational_problem category, ranking #24 of 61).^[2]

Key Facts

• 2-satisfiability's instance of is recorded as computational problem^[3].
• 2-satisfiability's subclass of is recorded as boolean satisfiability problem^[4].
• 2-satisfiability's Freebase ID is recorded as /m/02hkyt^[5].
• 2-satisfiability's Stack Exchange tag is recorded as https://cs.stackexchange.com/tags/2-sat^[6].
• 2-satisfiability's Stack Exchange tag is recorded as https://cstheory.stackexchange.com/tags/2sat^[7].
• 2-satisfiability's Stack Exchange tag is recorded as https://stackoverflow.com/tags/2-satisfiability^[8].
• 2-satisfiability's Microsoft Academic ID is recorded as 15481378^[9].
• 2-satisfiability's computational complexity is recorded as NL-complete^[10].

Why It Matters

2-satisfiability draws 83 Wikipedia views per month (computational_problem category, ranking #24 of 61).^[2] 2-satisfiability has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[11] 2-satisfiability is known by 4 alternative names across languages and contexts.^[12]