There's one kind of posts on this blog that get the most hostile reactions. It's not politics (nobody reads those), flaming programming languages, or computer games - the most controversial subject is Big O analysis! Here are relevant posts:

- Modern x86 assembly

- Big O analysis considered harmful

- Practical O(n) problem impossible to solve even for n=1

### The Official Complexity Theory

First, here's a brief repetition of Algorithms and Data Structures 201, or whatever your course explaining this was.An algorithm is O(f(n)) if in a particular model of computations, if there exist some constants n

_{0}, and c, such that for all input lengths greater than n, computation time is less than c × f(n). A problem is O(f(n)) if in particular model of computations there exists a O(f(n)) algorithm that solves it.

Models of computations are things like different varieties of Random access machine, and different models usually only differ by some logarithmic factors. Sometimes you want to assume that adding two numbers takes constant time, sometimes that it takes time proportional to logarithm of their sum, and details like that. If you disregard logarithmic factors, you don't have to be all that precise about which variety of RAM you're using. That's about it.

In particular, if the problem is only defined for constant-sized input, then by definition it has complexity O(1). There exists some c, such that for all possible sizes, running time of the algorithm is less that c × 1.

So breaking AES-128 is O(1). As is breaking RSA-4096. Breaking RSA-n for arbitrary n isn't, but that's entirely unrelated problem. Breaking AES-n is meaningless concept, as AES isn't defined for arbitrary n.

In particular classes like P, and NP, don't depend much on what reasonable computation model you're using. They're defined on Deterministic Turing Machines for reference (which is polynomial factor slower than RAM), but if something is P on DTM, it's P on RAM and vice versa.

### How cryptography handles it

As I got a lot of flames about my claim that breaking RSA-4096 is O(1), let me explain how cryptography handles it. So cryptography doesn't use Big O notation much.Security is measured in bits - a cryptosystem has k bits of security if the attacker must perform 2

^{k}times as many operations as legitimate user to defeat security of the cipher. For some types of security key size and security are related - for block ciphers security = key size, for hash collisions security = key size/2. For public key cryptography these bit measures can be only approximately specified in terms of key size, and whatever formula we have we're completely uninterested in its asymptotic form, as all feasible key sizes are small, and constant factors are of great interest to us.

### The Folk Complexity Theory

And now the main subject of the post - The Folk Complexity Theory. When people say some algorithm is O(f(n)), they actually mean that for "normal" sizes of inputs, on actual computers, it's expected running time is between two "small" constants times f(n) times reasonable number of log(n) factors as long as they don't push the constant too high.- O is used sort of like Θ of the official theory. Folk O(n) algorithm is not considered to be O(n
^{2}).

- So bubble sort is O(n
^{2}), as number of operation tends to be something like 10n^{2}. Logarithmic factor for addressing and arithmetic is not considered at all.

- Merge sort is O(n×log(n)), as number of operation tends to be something like 10n×log(n). Notice how log factor for number of operations is included here as it's significantly higher than allowed small constants; but log factor for cost of addressing and arithmetic is not, as on normal computers it's constant up to 2
^{32}, which is very big n. And only doubles for 2^{64}, which is too ridiculously high n to bother. Exactly the same reasoning can be used for both log factors, so this is highly peculiar.

- Quick sort is O(n×log(n)), the Folk Complexity Theory always deals with typical case, not worst case.

- Breaking AES-128 is O(2
^{n}) because the constant is too big to be allowed. It doesn't matter that there's no n here, and AES is not defined for other key sizes. The problem must be reformulated to have n, no matter if it makes any sense or not. Number of operation like 2^{140}is simply "not allowed", while 2^{12}×2^{n}is. - Breaking RSA-4096 is likewise O(2
^{n}), even though there's no n here at all.

- Forging signature of n-byte message signed with RSA-4096 is, uhm... O(2
^{n}). Wait, n is already something else... O(2^{k}) then maybe? The problem is reformulated as RSA-k because large constants are not allowed, and usually there's no point saying O(2^{k}+n), as n is too small to matter for all practical n. - As an added bonus "NP" usually means Θ(2
^{n}), for real or imagined n. This is spectacularly incorrect (most problems are not decision problems; there can be no Θ bounds even for NP-complete problems until NP != P is proven, and every P problem is NP), but doesn't cause much confusion in practice.

### Is Folk Complexity Theory useful?

It's quite amusing that so many people flame me for saying the Official Complexity Theory is overrated, and don't even know it. But I'm not going to blame them - who needs it once they're past exams anyway? In practice Folk Complexity Theory is actually better heuristic than the Official kind. We program real computers. On real input sizes. ceil(log_{2}(n)) factors shouldn't be ignored, but ceil(log

_{4294967296}(n)) factors which represent cost of arithmetic and addressing on most 32-bit computers hardware totally can and should. And so should all log(log(n)), which nobody ever bother with past exams.

The Folk Complexity Theory has weird status - it's neither mathematics like the Official theory, nor practice like actual benchmarking. It's just a bunch of heuristics dressed as something much more formal than they are. Often even fairly useful heuristics. Just nothing more than that, and not worth the flames.

## 4 comments:

You're trollin hard I see. That or you're an idiot

The problem with your point is that you're saying "Big-Oh isn't realistic enough since it doesn't take into account the inherent latency of the cache hierarchy on my computer". That's not what Big-Oh is about, it's about establishing a metric for the relative speed of algorithms in terms of primitive operations. There's a similar problem with benchmarks in that when you collect benchmarks you're only gathering runtime data on one machine at one point in time - that's neither general nor reliable. In order to be general Big-Oh sacrifices a bit of accuracy, but it only ever claimed to be an approximation anyway.

And then -- even more flames. Delicious.

Nice try, son. Get yourself a copy of Knuth, read the first part, and come back when you grasp it.

Here's a hint: asymptotic notation ("Big Oh notation") requires you to make an intelligent choice about what you're counting. Yes, if you choose an AES operation on a data block as what you're counting, the AES is trivially O(1). Count something useful, it's rather different.

Post a Comment