asymptotic

The algorithm is mutating vectors - the direct translation is to use ST, and will have the same asymptotic behavior as the C++ version.

It's an open problem whether it can be translated into a pure, lazy language without an asymptotic slowdown.

JavaScript was a terrible language, and JS developers couldn't perform asymptotic analysis to save their life.

You only get O(1) by selectively ignoring one kind of asymptotic behavior (that of the computations needed for the hash).

In all of these cases, self-adjusting computation leads to asymptotic improvements compared to batch computation.

Non- constructive asymptotic existence proofs are critical to proving these instances are difficult.

Lazy evaluation performs implicit side effects, which in some cases (and with RT as a premise) allows for better asymptotic complexity than eager evaulation.

Second, of course it will be asymptotic for a long time.

Also, random noise can trigger asymptotic feedback at high levels.

And asymptotic feedback tends to blow out amps and speakers.

Okay, now I'm curious: how'd they manage to get O(n^2) asymptotic complexity out of what looks like a relatively simple semi-transparent photo overlay?

Back in 1918, Hardy and Ramanujan found an amazing formula, an asymptotic series that you can use to compute p(n) exactly with a manageable amount of computation.

The problem is that it has a "trivial additive constant" which will make it take longer than the lifetimes of many stars to achieve its much-vaunted "optimal" asymptotic performance.

When the entrepreneur pays his staff, it devalues again, and so on until it reaches some theoretical "room temperature" asymptotic point and the inflationary effect is complete.

We're talking about fixed-size operations, so there's no notion of asymptotic expensiveness here, but yes, FHE "addition" and "multiplication" are very expensive.

“Now at least we know the effort should focus on constructing them.” I only glanced at the paper, but perhaps this is analogous to Shannon's original proof of existence of codes meeting channel capacity -- which was also a non-constructive, asymptotic result.