Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
guarantees finding a solution if one exists
inefficient for large problem spaces |
| gptkbp:alternativeName |
exhaustive search
|
| gptkbp:characteristic |
tries all possible solutions
|
| gptkbp:complexity |
often exponential time
|
| gptkbp:contrastsWith |
dynamic programming
greedy algorithms heuristic algorithms |
| gptkbp:example |
password cracking
travelling salesman problem (naive solution) |
| gptkbp:usedIn |
computer science
cryptography search problems |
| gptkbp:bfsParent |
gptkb:Mark_Hellinger
gptkb:Sam_Levene gptkb:Yvonne_De_Carlo gptkb:John_Nicholas_Cassavetes gptkb:Digital_Anvil |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Brute Force
|