Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Random SAT
|
| gptkbp:input |
randomly generated Boolean formula
|
| gptkbp:notableFor |
hardness for certain algorithms
sharp threshold behavior |
| gptkbp:output |
satisfiable or unsatisfiable
|
| gptkbp:parameter |
number of variables
number of clauses |
| gptkbp:relatedTo |
gptkb:NP-completeness
Boolean satisfiability problem |
| gptkbp:studiedBy |
gptkb:Scott_Kirkpatrick
gptkb:Uriel_Feige gptkb:Dimitris_Achlioptas phase transitions algorithmic hardness |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:usedIn |
benchmarking SAT solvers
|
| gptkbp:variant |
gptkb:k-SAT
|
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|