Embedded Files
Algorithm Revision
Algorithm Revision
Computer Science Field Guide - Algorithms
Chapter sections
Chapter sections
BIG O notation
Encryption Revision
Encryption Revision
In CS encryption keys and passwords should be so long that even a really fast computer program would take an impractically long time to try out every possible combination. Because each additional character greatly increases the number of combinations to try, a brute-force attack quickly becomes INTRACTABLE
Increasing the length of a password makes a huge difference to the difficulty of cracking it. It becomes even harder when you include letter and special characters in the password.
Computer Science Field Guide - Encryption
Chapter sections
Chapter sections
8.3. Cryptosystems used in practice
8.4. The key distribution problem
Complexity and Tractability
Complexity and Tractability
Computer Science Field Guide - Complexity and Tractability
Chapter sections
Chapter sections
11.2. Algorithms, problems, and speed limits
11.4. The Travelling Salesman Problem
Other Resources
Other Resources
Heuristics for TSP (good)
The “knapsack problem” appears in many forms in economics, engineering, and business
Applications
Applications
Real World Companies lik Telogis, Kamar - Timetabling
Encryption
Encryption
Ways of solving intractable problems
Limitations
Limitations
Page updated
Report abuse