succinct circuit satisfiability
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
succinct SAT
|
| gptkbp:complexity |
NEXP-complete
|
| gptkbp:firstDescribed |
gptkb:Leonid_Levin
1970s |
| gptkbp:generalizes |
Boolean satisfiability problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
succinct circuit satisfiability
|
| gptkbp:input |
circuit described by a Boolean circuit
|
| gptkbp:relatedTo |
circuit complexity
exponential time complexity |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:NEXPTIME
|
| gptkbp:bfsLayer |
6
|