What is the computational complexity of the 2-satisfiability problem? (Q281): Difference between revisions
Created claim: mention (P38): 2SAT |
Changed claim: mention (P38): clase de complejidad |
||
| (4 intermediate revisions by the same user not shown) | |||
| aliases / es / 0 | aliases / es / 0 | ||
¿En qué clase de complejidad está 2-SAT? | |||
| aliases / es / 1 | aliases / es / 1 | ||
| Property / mention | |||
clase de complejidad (Spanish) | |||
| Property / mention: clase de complejidad (Spanish) / rank | |||
Normal rank | |||
| Property / mention: clase de complejidad (Spanish) / qualifier | |||
| Property / mention | |||
clase (Spanish) | |||
| Property / mention: clase (Spanish) / rank | |||
Normal rank | |||
| Property / mention: clase (Spanish) / qualifier | |||
| Property / mention | |||
2-SAT (Spanish) | |||
| Property / mention: 2-SAT (Spanish) / rank | |||
Normal rank | |||
| Property / mention: 2-SAT (Spanish) / qualifier | |||
Latest revision as of 23:37, 12 March 2026
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