Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
P-complete
|
| gptkbp:decision |
yes
|
| gptkbp:describedBy |
Cook, 1971
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:hardness |
P-complete under logspace reductions
|
| https://www.w3.org/2000/01/rdf-schema#label |
circuit value problem
|
| gptkbp:input |
Boolean circuit
input values for circuit |
| gptkbp:isSolvable |
polynomial time
|
| gptkbp:output |
output value of circuit
|
| gptkbp:relatedTo |
Boolean satisfiability problem
circuit satisfiability problem |
| gptkbp:studiedBy |
gptkb:Stephen_Cook
|
| gptkbp:usedIn |
gptkb:complexity_theory
|
| gptkbp:bfsParent |
gptkb:succinct_circuit_value_problem
|
| gptkbp:bfsLayer |
6
|