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

From QAWiki
Revision as of 22:49, 21 May 2022 by Aidan (talk | contribs) (‎Created claim: Property:P38: problema de 2-satisfactibilidad)
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

0 references
SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . }
0 references
computational complexity (English)
0 references
computational (English)
0 references
2-satisfiability problem (English)
0 references
2-satisfiability (English)
0 references
0 references
2SAT (English)
0 references
complexity class (English)
0 references
class (English)
0 references
2-SAT (English)
0 references
complejidad computacional (Spanish)
0 references
problema de 2-satisfactibilidad (Spanish)
0 references