7 ms·
Besides brute force decryption, does anyone have some good examples of O(2^N) algorithms? Also: http://www.kurzweilai.net/software-progress-beats-moores-law h
by hypnocode 14y ago
Besides brute force decryption, does anyone have some good examples of O(2^N) algorithms?
Also:
http://www.kurzweilai.net/software-progress-beats-moores-law http://www.kurzweilai.net/software-progress-beats-moores-law
Algorithmic improvement account for more of the acceleration in computing power than physical factors, such as transistor density.
- tsahyt 14y agoSAT for instance has only been solved with O(2^n) algorithms so far. The tricky thing here is that we don't quite know whether it could be done any quicker (google up P=NP for a more detailed description).