Difference between revisions of "What is the computational complexity of the 2-satisfiability problem? (Q281)"
Jump to navigation
Jump to search
(Created claim: mention (P38): 2SAT) |
(Created claim: mention (P38): clase complejidad) |
||
| Property / mention | |||
clase complejidad (Spanish) | |||
| Property / mention: clase complejidad (Spanish) / rank | |||
Normal rank | |||
| Property / mention: clase complejidad (Spanish) / qualifier | |||
Revision as of 22:52, 21 May 2022
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
|
|
Statements
SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . }
0 references
computational complexity (English)
0 references
complejidad computacional (Spanish)
0 references