What is the computational complexity of the 2-satisfiability problem? (Q281)

From QAWiki
Revision as of 22:39, 21 May 2022 by Aidan (talk | contribs) (‎Created a new Item: What is the computational complexity of the 2-satisfiability problem?)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
No description defined
  • What is the complexity of 2SAT?
  • What is the complexity class of 2-SAT?
Language Label Description Also known as
English
What is the computational complexity of the 2-satisfiability problem?
No description defined
  • What is the complexity of 2SAT?
  • What is the complexity class of 2-SAT?

Statements

 
Retrieved from "http://qawiki.org/w/index.php?title=Item:Q281&oldid=6105"