Is there a concept for an algorithm computing a function by first finding another algorithm? – cs.stackexchange.com

If I understand it correctly, an algorithm that computes the value of a real function $f$ has computational complexity $O(g(n))$ if the following holds: When we compute $f$ to precision $\delta$ ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

0 Comment to "Is there a concept for an algorithm computing a function by first finding another algorithm? – cs.stackexchange.com"