What is the computational complexity of the 2-satisfiability problem? (Q281): Difference between revisions
Created claim: instance of (P1): question (Q1) |
Created claim: query (P11): SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . } |
||
| Property / query | |||
SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . } | |||
| Property / query: SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . } / rank | |||
Normal rank | |||
| Property / query: SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . } / qualifier | |||
| Property / query: SELECT ?obj WHERE { wd:Q4596967 wdt:P10374 ?obj . } / qualifier | |||
Revision as of 22:42, 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