Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:CVP
|
| gptkbp:completeFor |
class P
|
| gptkbp:complexity |
P-complete
|
| gptkbp:definedIn |
Given a Boolean circuit and an input, determine the output value.
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Circuit Value Problem
|
| gptkbp:introducedIn |
1975
|
| gptkbp:relatedTo |
Boolean satisfiability problem
Boolean circuit NC (complexity) |
| gptkbp:studiedBy |
gptkb:Richard_E._Ladner
gptkb:Albert_R._Meyer Larry J. Stockmeyer |
| gptkbp:bfsParent |
gptkb:Generalized_Circuit_Value_Problem
|
| gptkbp:bfsLayer |
6
|